./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f1741d130075f1f7f25c8fd49724f342261e16295a533d1b7fc59c9fdd3354e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:08:53,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:08:53,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 12:08:53,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:08:53,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:08:53,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:08:53,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:08:53,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:08:53,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:08:53,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:08:53,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:08:53,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:08:53,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:08:53,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:08:53,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:08:53,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:08:53,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:08:53,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:08:53,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:08:53,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:08:53,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:08:53,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:08:53,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:53,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:08:53,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:08:53,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:08:53,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:08:53,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:08:53,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:08:53,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:08:53,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:08:53,739 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/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 -> f1741d130075f1f7f25c8fd49724f342261e16295a533d1b7fc59c9fdd3354e1 [2025-03-17 12:08:53,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:08:53,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:08:53,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:08:53,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:08:53,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:08:53,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i [2025-03-17 12:08:55,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f76957e/d077d88418c14bccb80f9f9b068a0ac5/FLAGd6ee2f961 [2025-03-17 12:08:55,791 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:08:55,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i [2025-03-17 12:08:55,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f76957e/d077d88418c14bccb80f9f9b068a0ac5/FLAGd6ee2f961 [2025-03-17 12:08:56,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f76957e/d077d88418c14bccb80f9f9b068a0ac5 [2025-03-17 12:08:56,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:08:56,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:08:56,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:56,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:08:56,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:08:56,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:56" (1/1) ... [2025-03-17 12:08:56,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59190e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:56, skipping insertion in model container [2025-03-17 12:08:56,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:56" (1/1) ... [2025-03-17 12:08:56,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:08:56,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:56,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:08:56,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:57,008 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:08:57,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57 WrapperNode [2025-03-17 12:08:57,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:57,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:57,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:08:57,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:08:57,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,075 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2025-03-17 12:08:57,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:57,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:08:57,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:08:57,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:08:57,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,139 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 6 writes are split as follows [6]. [2025-03-17 12:08:57,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:08:57,170 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:08:57,170 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:08:57,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:08:57,171 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (1/1) ... [2025-03-17 12:08:57,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:57,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:08:57,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:08:57,280 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-03-17 12:08:57,281 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-03-17 12:08:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-17 12:08:57,281 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-17 12:08:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:08:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:08:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:08:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:08:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:08:57,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:08:57,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:08:57,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:08:57,884 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-17 12:08:57,891 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:08:57,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:08:57,910 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:08:57,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:57 BoogieIcfgContainer [2025-03-17 12:08:57,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:08:57,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:08:57,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:08:57,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:08:57,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:08:56" (1/3) ... [2025-03-17 12:08:57,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e48e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:57, skipping insertion in model container [2025-03-17 12:08:57,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:57" (2/3) ... [2025-03-17 12:08:57,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e48e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:57, skipping insertion in model container [2025-03-17 12:08:57,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:57" (3/3) ... [2025-03-17 12:08:57,929 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-shared-sll-after.i [2025-03-17 12:08:57,952 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:08:57,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-shared-sll-after.i that has 3 procedures, 80 locations, 1 initial locations, 5 loop locations, and 29 error locations. [2025-03-17 12:08:58,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:08:58,054 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;@119a962c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:08:58,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-17 12:08:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 73 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:08:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:58,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:58,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:58,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:08:58,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:58,083 INFO L85 PathProgramCache]: Analyzing trace with hash 3274349, now seen corresponding path program 1 times [2025-03-17 12:08:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594099984] [2025-03-17 12:08:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:58,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:58,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:58,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:58,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:58,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594099984] [2025-03-17 12:08:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594099984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:58,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488369153] [2025-03-17 12:08:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:58,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:58,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:58,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:58,432 INFO L87 Difference]: Start difference. First operand has 80 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 73 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-03-17 12:08:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:58,559 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-03-17 12:08:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:58,567 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-03-17 12:08:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:58,576 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:08:58,581 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:08:58,582 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-03-17 12:08:58,589 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:58,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:08:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 12:08:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:08:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-03-17 12:08:58,653 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 4 [2025-03-17 12:08:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:58,656 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-03-17 12:08:58,656 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-03-17 12:08:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-03-17 12:08:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:58,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:58,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:58,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:08:58,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:08:58,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash 3274350, now seen corresponding path program 1 times [2025-03-17 12:08:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:58,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472261570] [2025-03-17 12:08:58,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:58,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:58,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:58,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472261570] [2025-03-17 12:08:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472261570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242079620] [2025-03-17 12:08:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:58,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:58,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:58,801 INFO L87 Difference]: Start difference. First operand 76 states and 82 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-03-17 12:08:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:58,893 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-03-17 12:08:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:58,894 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-03-17 12:08:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:58,895 INFO L225 Difference]: With dead ends: 74 [2025-03-17 12:08:58,895 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 12:08:58,895 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-03-17 12:08:58,896 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:58,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 12:08:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 12:08:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 67 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:08:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-03-17 12:08:58,900 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 4 [2025-03-17 12:08:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:58,901 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-03-17 12:08:58,901 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-03-17 12:08:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-03-17 12:08:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:08:58,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:58,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:58,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:08:58,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:08:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2004069949, now seen corresponding path program 1 times [2025-03-17 12:08:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655680505] [2025-03-17 12:08:58,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:58,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:08:58,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:08:58,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:58,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:59,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655680505] [2025-03-17 12:08:59,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655680505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:59,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666925447] [2025-03-17 12:08:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:59,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:59,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:59,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:59,084 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:59,168 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2025-03-17 12:08:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 12:08:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:59,170 INFO L225 Difference]: With dead ends: 73 [2025-03-17 12:08:59,175 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 12:08:59,175 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-03-17 12:08:59,176 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:59,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 126 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 12:08:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-17 12:08:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 66 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:08:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-03-17 12:08:59,182 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 15 [2025-03-17 12:08:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:59,190 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-03-17 12:08:59,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-03-17 12:08:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:08:59,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:59,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:59,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:08:59,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:08:59,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2004069948, now seen corresponding path program 1 times [2025-03-17 12:08:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318350654] [2025-03-17 12:08:59,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:59,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:08:59,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:08:59,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:59,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:59,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318350654] [2025-03-17 12:08:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318350654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031517718] [2025-03-17 12:08:59,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:59,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:59,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:59,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:59,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:59,421 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:59,488 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2025-03-17 12:08:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 12:08:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:59,490 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:08:59,491 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:08:59,491 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-03-17 12:08:59,492 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:59,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:08:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 12:08:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.627906976744186) internal successors, (70), 65 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:08:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-03-17 12:08:59,510 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 15 [2025-03-17 12:08:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:59,510 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-03-17 12:08:59,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-03-17 12:08:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:08:59,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:59,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:08:59,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:08:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash -829108120, now seen corresponding path program 1 times [2025-03-17 12:08:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:59,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651344701] [2025-03-17 12:08:59,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:59,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:08:59,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:08:59,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:59,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:59,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651344701] [2025-03-17 12:08:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651344701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57511482] [2025-03-17 12:08:59,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:59,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:59,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:59,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:09:00,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:09:00,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:09:00,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:00,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:00,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:09:00,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:00,103 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-03-17 12:09:00,171 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-03-17 12:09:00,281 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:09:00,281 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-03-17 12:09:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-17 12:09:00,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57511482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:00,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-17 12:09:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300459727] [2025-03-17 12:09:00,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:00,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:09:00,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:00,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:09:00,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:09:00,392 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:00,786 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-03-17 12:09:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:00,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-17 12:09:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:00,788 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:09:00,788 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:09:00,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:09:00,793 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:00,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 80 Unchecked, 0.3s Time] [2025-03-17 12:09:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:09:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-17 12:09:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.608695652173913) internal successors, (74), 67 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:09:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-17 12:09:00,806 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 19 [2025-03-17 12:09:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:00,806 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-17 12:09:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-17 12:09:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:09:00,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:00,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:00,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:09:01,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:01,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -829108119, now seen corresponding path program 1 times [2025-03-17 12:09:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192223637] [2025-03-17 12:09:01,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:01,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:09:01,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:09:01,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:01,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:01,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:01,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192223637] [2025-03-17 12:09:01,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192223637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:01,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76963736] [2025-03-17 12:09:01,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:01,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:01,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:01,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:01,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:09:01,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:09:01,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:09:01,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:01,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:01,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:09:01,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:01,807 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-03-17 12:09:01,827 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-03-17 12:09:02,046 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-03-17 12:09:02,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:02,086 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-03-17 12:09:02,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:02,097 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-03-17 12:09:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-17 12:09:02,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:02,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76963736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:02,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:02,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2025-03-17 12:09:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043227397] [2025-03-17 12:09:02,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:02,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:09:02,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:02,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:09:02,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=1, NotChecked=24, Total=210 [2025-03-17 12:09:02,228 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:02,466 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-03-17 12:09:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:09:02,466 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-17 12:09:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:02,467 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:09:02,468 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:09:02,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-03-17 12:09:02,470 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 8 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:02,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 359 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 241 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2025-03-17 12:09:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:09:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-03-17 12:09:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.5625) internal successors, (75), 69 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:09:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2025-03-17 12:09:02,477 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 19 [2025-03-17 12:09:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:02,477 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2025-03-17 12:09:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2025-03-17 12:09:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:09:02,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:02,477 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-03-17 12:09:02,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 12:09:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 12:09:02,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:02,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash -324539039, now seen corresponding path program 1 times [2025-03-17 12:09:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:02,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773236700] [2025-03-17 12:09:02,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:02,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:09:02,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:09:02,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:02,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:03,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773236700] [2025-03-17 12:09:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773236700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:03,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:03,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 12:09:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895886342] [2025-03-17 12:09:03,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:03,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:09:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:03,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:09:03,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:09:03,105 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-03-17 12:09:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:03,481 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-03-17 12:09:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:03,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 24 [2025-03-17 12:09:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:03,485 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:09:03,486 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:09:03,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:09:03,490 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:03,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:09:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:09:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 12:09:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.56) internal successors, (78), 70 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:09:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-03-17 12:09:03,499 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 24 [2025-03-17 12:09:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:03,500 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-03-17 12:09:03,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-03-17 12:09:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-03-17 12:09:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:09:03,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:03,500 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-03-17 12:09:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:09:03,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -324539038, now seen corresponding path program 1 times [2025-03-17 12:09:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545599623] [2025-03-17 12:09:03,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:03,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:09:03,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:09:03,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:03,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545599623] [2025-03-17 12:09:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545599623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:04,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 12:09:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271984124] [2025-03-17 12:09:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:04,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:09:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:04,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:09:04,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:09:04,119 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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-03-17 12:09:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:04,618 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2025-03-17 12:09:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:09:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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 24 [2025-03-17 12:09:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:04,620 INFO L225 Difference]: With dead ends: 95 [2025-03-17 12:09:04,623 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:09:04,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:09:04,625 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:04,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 375 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:09:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:09:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2025-03-17 12:09:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 78 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:09:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2025-03-17 12:09:04,642 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 24 [2025-03-17 12:09:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:04,642 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2025-03-17 12:09:04,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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-03-17 12:09:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2025-03-17 12:09:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:09:04,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:04,642 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-03-17 12:09:04,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:09:04,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:04,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1470783490, now seen corresponding path program 1 times [2025-03-17 12:09:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:04,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008409753] [2025-03-17 12:09:04,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:09:04,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:09:04,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:04,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:04,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:04,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008409753] [2025-03-17 12:09:04,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008409753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:04,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:04,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:09:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092284566] [2025-03-17 12:09:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:04,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:09:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:04,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:09:04,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:09:04,806 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:09:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:04,896 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2025-03-17 12:09:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:04,898 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), 2 states have call successors, (2), 1 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 25 [2025-03-17 12:09:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:04,899 INFO L225 Difference]: With dead ends: 88 [2025-03-17 12:09:04,900 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 12:09:04,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-03-17 12:09:04,905 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:04,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 423 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:09:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 12:09:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-17 12:09:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 78 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:09:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2025-03-17 12:09:04,915 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 25 [2025-03-17 12:09:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:04,915 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2025-03-17 12:09:04,915 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:09:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2025-03-17 12:09:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:09:04,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:04,920 INFO L218 NwaCegarLoop]: trace histogram [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-03-17 12:09:04,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:09:04,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:04,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1931583116, now seen corresponding path program 1 times [2025-03-17 12:09:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:04,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995012392] [2025-03-17 12:09:04,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:04,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:09:04,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:09:04,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:05,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:05,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995012392] [2025-03-17 12:09:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995012392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:05,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017544668] [2025-03-17 12:09:05,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:05,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:05,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:05,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:05,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:09:05,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:09:05,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:09:05,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:05,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:05,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:09:05,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:05,327 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-03-17 12:09:05,353 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-17 12:09:05,397 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:09:05,397 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-03-17 12:09:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:09:05,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017544668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:05,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-17 12:09:05,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532410490] [2025-03-17 12:09:05,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:05,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:09:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:05,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:09:05,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:09:05,466 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:09:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:05,783 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-03-17 12:09:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:05,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-17 12:09:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:05,784 INFO L225 Difference]: With dead ends: 91 [2025-03-17 12:09:05,784 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 12:09:05,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:09:05,785 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:05,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 302 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 205 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2025-03-17 12:09:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 12:09:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-17 12:09:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 80 states have internal predecessors, (90), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2025-03-17 12:09:05,789 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 28 [2025-03-17 12:09:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:05,789 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2025-03-17 12:09:05,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:09:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2025-03-17 12:09:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:09:05,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:05,790 INFO L218 NwaCegarLoop]: trace histogram [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-03-17 12:09:05,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:05,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:05,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:05,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1931583117, now seen corresponding path program 1 times [2025-03-17 12:09:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:05,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028081516] [2025-03-17 12:09:05,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:06,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:09:06,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:09:06,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:06,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028081516] [2025-03-17 12:09:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028081516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650213536] [2025-03-17 12:09:06,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:06,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:06,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:06,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:06,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:09:06,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:09:06,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:09:06,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:06,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:06,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:09:06,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:06,599 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-03-17 12:09:06,658 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-03-17 12:09:06,691 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:09:06,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:09:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:09:06,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650213536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:06,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:06,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-03-17 12:09:06,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147350652] [2025-03-17 12:09:06,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:06,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:09:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:06,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:09:06,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:09:06,801 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:09:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:07,034 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2025-03-17 12:09:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:09:07,034 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-17 12:09:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:07,035 INFO L225 Difference]: With dead ends: 93 [2025-03-17 12:09:07,035 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 12:09:07,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:09:07,035 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:07,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 348 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2025-03-17 12:09:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 12:09:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-03-17 12:09:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 82 states have internal predecessors, (91), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2025-03-17 12:09:07,048 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 28 [2025-03-17 12:09:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2025-03-17 12:09:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:09:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2025-03-17 12:09:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:09:07,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:07,050 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:07,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:07,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:07,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:07,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1380162461, now seen corresponding path program 1 times [2025-03-17 12:09:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392207744] [2025-03-17 12:09:07,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:07,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:09:07,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:09:07,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:07,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:08,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:08,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392207744] [2025-03-17 12:09:08,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392207744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:08,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498412337] [2025-03-17 12:09:08,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:08,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:08,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:08,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:08,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:09:08,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:09:08,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:09:08,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:08,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:08,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-17 12:09:08,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:08,387 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-03-17 12:09:08,391 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-03-17 12:09:08,470 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 19 treesize of output 18 [2025-03-17 12:09:08,498 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 19 treesize of output 18 [2025-03-17 12:09:08,932 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base) 0 0))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base) 0 0)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-03-17 12:09:08,976 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 12:09:08,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2025-03-17 12:09:08,996 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 12:09:08,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2025-03-17 12:09:09,245 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-17 12:09:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2025-03-17 12:09:09,302 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-17 12:09:09,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2025-03-17 12:09:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:09,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498412337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:09,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:09,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2025-03-17 12:09:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114942849] [2025-03-17 12:09:09,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:09,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 12:09:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:09,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 12:09:09,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=682, Unknown=1, NotChecked=52, Total=812 [2025-03-17 12:09:09,915 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:09:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:10,841 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-03-17 12:09:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:09:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (3), 3 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 28 [2025-03-17 12:09:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:10,843 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:09:10,843 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:09:10,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=1420, Unknown=1, NotChecked=76, Total=1640 [2025-03-17 12:09:10,845 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:10,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 910 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 589 Invalid, 0 Unknown, 93 Unchecked, 0.5s Time] [2025-03-17 12:09:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:09:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-03-17 12:09:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 84 states have internal predecessors, (93), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-03-17 12:09:10,863 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 28 [2025-03-17 12:09:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:10,863 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-03-17 12:09:10,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:09:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-03-17 12:09:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:09:10,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:10,864 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] [2025-03-17 12:09:10,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:09:11,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 12:09:11,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash -164644542, now seen corresponding path program 1 times [2025-03-17 12:09:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080198766] [2025-03-17 12:09:11,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:11,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:09:11,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:09:11,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:11,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:11,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-03-17 12:09:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080198766] [2025-03-17 12:09:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080198766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553950980] [2025-03-17 12:09:11,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:11,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:11,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:11,167 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:11,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:09:11,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:09:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:09:11,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:11,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:11,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:09:11,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:11,302 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-03-17 12:09:11,418 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-17 12:09:11,445 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:09:11,446 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-03-17 12:09:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:11,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:09:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553950980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:09:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 11 [2025-03-17 12:09:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142351678] [2025-03-17 12:09:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:11,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:09:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:11,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:09:11,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=90, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:09:11,462 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-03-17 12:09:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:11,586 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-03-17 12:09:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:09:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 29 [2025-03-17 12:09:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:11,587 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:09:11,587 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:09:11,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=90, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:09:11,587 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 7 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:11,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 274 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 266 Invalid, 0 Unknown, 145 Unchecked, 0.1s Time] [2025-03-17 12:09:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:09:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 12:09:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 85 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-03-17 12:09:11,591 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2025-03-17 12:09:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:11,591 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-03-17 12:09:11,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-03-17 12:09:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-03-17 12:09:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:09:11,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:11,595 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] [2025-03-17 12:09:11,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:11,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:11,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash -164644541, now seen corresponding path program 1 times [2025-03-17 12:09:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:11,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503647704] [2025-03-17 12:09:11,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:11,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:09:11,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:09:11,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:11,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503647704] [2025-03-17 12:09:12,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503647704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:12,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959777040] [2025-03-17 12:09:12,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:12,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:12,111 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:12,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:09:12,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:09:12,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:09:12,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:12,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:12,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 12:09:12,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:12,213 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-03-17 12:09:12,216 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-03-17 12:09:12,358 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-17 12:09:12,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:12,374 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-03-17 12:09:12,380 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:12,381 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-03-17 12:09:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:12,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:09:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959777040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:12,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:09:12,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 17 [2025-03-17 12:09:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825263362] [2025-03-17 12:09:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:12,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:09:12,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:12,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:09:12,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2025-03-17 12:09:12,408 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-03-17 12:09:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:12,568 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2025-03-17 12:09:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2025-03-17 12:09:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:12,569 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:09:12,569 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:09:12,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2025-03-17 12:09:12,570 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:12,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 258 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2025-03-17 12:09:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:09:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-17 12:09:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 87 states have internal predecessors, (97), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-03-17 12:09:12,573 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 29 [2025-03-17 12:09:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:12,573 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-03-17 12:09:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-03-17 12:09:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-03-17 12:09:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:09:12,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:12,574 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-03-17 12:09:12,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:12,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:12,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:12,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash -809024367, now seen corresponding path program 1 times [2025-03-17 12:09:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388249771] [2025-03-17 12:09:12,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:12,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:09:12,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:09:12,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:12,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388249771] [2025-03-17 12:09:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388249771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:12,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:09:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275708431] [2025-03-17 12:09:12,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:12,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:09:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:12,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:09:12,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:09:12,856 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:09:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:12,899 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2025-03-17 12:09:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 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 30 [2025-03-17 12:09:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:12,900 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:09:12,900 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 12:09:12,900 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-03-17 12:09:12,900 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:12,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 400 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:09:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 12:09:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-03-17 12:09:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 88 states have internal predecessors, (97), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-03-17 12:09:12,903 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 30 [2025-03-17 12:09:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:12,903 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-03-17 12:09:12,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:09:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-03-17 12:09:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:09:12,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:12,907 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:12,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:09:12,907 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash -357206987, now seen corresponding path program 1 times [2025-03-17 12:09:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270405239] [2025-03-17 12:09:12,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:12,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:09:12,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:09:12,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:09:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270405239] [2025-03-17 12:09:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270405239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104590152] [2025-03-17 12:09:13,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:13,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:13,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:13,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:13,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:09:13,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:09:13,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:09:13,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:13,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:13,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 12:09:13,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:13,152 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-03-17 12:09:13,162 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-03-17 12:09:13,166 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 17 treesize of output 9 [2025-03-17 12:09:13,177 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-03-17 12:09:13,192 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:09:13,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:09:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2025-03-17 12:09:13,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:13,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104590152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:13,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:13,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-03-17 12:09:13,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623554109] [2025-03-17 12:09:13,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:13,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 12:09:13,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:13,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 12:09:13,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:09:13,301 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:09:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:13,465 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2025-03-17 12:09:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:13,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2025-03-17 12:09:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:13,466 INFO L225 Difference]: With dead ends: 97 [2025-03-17 12:09:13,466 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 12:09:13,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-03-17 12:09:13,467 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:13,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 415 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 266 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2025-03-17 12:09:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 12:09:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 12:09:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 87 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-03-17 12:09:13,469 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 32 [2025-03-17 12:09:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:13,469 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-03-17 12:09:13,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:09:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-03-17 12:09:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:09:13,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:13,470 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:13,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:09:13,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 12:09:13,671 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:13,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash -357206986, now seen corresponding path program 1 times [2025-03-17 12:09:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:13,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679335394] [2025-03-17 12:09:13,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:13,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:13,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:09:13,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:09:13,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:13,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:13,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679335394] [2025-03-17 12:09:13,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679335394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899533731] [2025-03-17 12:09:13,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:13,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:13,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:13,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:13,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:09:14,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:09:14,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:09:14,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:14,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:14,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 12:09:14,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:14,083 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-03-17 12:09:14,086 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-03-17 12:09:14,177 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-03-17 12:09:14,182 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-03-17 12:09:14,208 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 26 treesize of output 14 [2025-03-17 12:09:14,269 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-03-17 12:09:14,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:14,290 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-03-17 12:09:14,295 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:14,296 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-03-17 12:09:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2025-03-17 12:09:14,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899533731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:14,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2025-03-17 12:09:14,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720048894] [2025-03-17 12:09:14,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:14,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 12:09:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:14,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 12:09:14,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2025-03-17 12:09:14,393 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:14,719 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2025-03-17 12:09:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:09:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2025-03-17 12:09:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:14,720 INFO L225 Difference]: With dead ends: 95 [2025-03-17 12:09:14,720 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:09:14,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=562, Unknown=1, NotChecked=48, Total=702 [2025-03-17 12:09:14,721 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 8 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:14,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 647 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 495 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2025-03-17 12:09:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:09:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-03-17 12:09:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:09:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2025-03-17 12:09:14,724 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 32 [2025-03-17 12:09:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:14,724 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2025-03-17 12:09:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2025-03-17 12:09:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:09:14,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:14,725 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] [2025-03-17 12:09:14,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:09:14,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:09:14,926 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -72898756, now seen corresponding path program 1 times [2025-03-17 12:09:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167565485] [2025-03-17 12:09:14,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:14,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:09:14,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:09:14,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:14,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167565485] [2025-03-17 12:09:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167565485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:15,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:15,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:09:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862980142] [2025-03-17 12:09:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:15,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:09:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:15,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:09:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:09:15,006 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:09:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:15,098 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-03-17 12:09:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:15,099 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), 2 states have call successors, (2), 1 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 32 [2025-03-17 12:09:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:15,099 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:09:15,100 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:09:15,100 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-03-17 12:09:15,100 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:15,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 318 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:09:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:09:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 12:09:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.380281690140845) internal successors, (98), 86 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:09:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-03-17 12:09:15,102 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 32 [2025-03-17 12:09:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:15,103 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-03-17 12:09:15,103 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:09:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-03-17 12:09:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:09:15,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:15,103 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] [2025-03-17 12:09:15,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:09:15,104 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:15,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 859636487, now seen corresponding path program 1 times [2025-03-17 12:09:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026598061] [2025-03-17 12:09:15,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:15,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:09:15,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:09:15,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:15,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026598061] [2025-03-17 12:09:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026598061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211027595] [2025-03-17 12:09:15,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:15,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:15,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:15,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:15,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:09:15,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:09:15,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:09:15,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:15,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:15,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 12:09:15,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:15,573 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-03-17 12:09:15,576 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-03-17 12:09:15,745 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:09:15,745 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-03-17 12:09:15,751 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-03-17 12:09:15,829 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-17 12:09:15,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:15,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-03-17 12:09:15,858 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 12:09:15,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 12:09:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-17 12:09:15,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211027595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:16,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2025-03-17 12:09:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042066438] [2025-03-17 12:09:16,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:09:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:09:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=664, Unknown=1, NotChecked=52, Total=812 [2025-03-17 12:09:16,033 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:16,410 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-03-17 12:09:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:09:16,411 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-17 12:09:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:16,411 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:09:16,411 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:09:16,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=919, Unknown=1, NotChecked=62, Total=1122 [2025-03-17 12:09:16,412 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:16,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 382 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 484 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2025-03-17 12:09:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:09:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 12:09:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 87 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:09:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2025-03-17 12:09:16,415 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 36 [2025-03-17 12:09:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:16,415 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2025-03-17 12:09:16,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2025-03-17 12:09:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:09:16,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:16,416 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, 1, 1] [2025-03-17 12:09:16,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:16,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:16,620 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:16,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:16,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1526606139, now seen corresponding path program 1 times [2025-03-17 12:09:16,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:16,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829136974] [2025-03-17 12:09:16,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:16,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:16,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:09:16,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:09:16,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:16,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829136974] [2025-03-17 12:09:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829136974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142362058] [2025-03-17 12:09:16,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:16,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:16,794 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:16,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:09:16,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:09:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:09:16,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:16,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:16,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 12:09:16,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:16,950 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 8 treesize of output 1 [2025-03-17 12:09:16,953 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 8 treesize of output 1 [2025-03-17 12:09:17,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:17,012 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-03-17 12:09:17,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:17,019 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-03-17 12:09:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:17,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:17,227 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 33 treesize of output 29 [2025-03-17 12:09:17,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:17,234 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 36 treesize of output 40 [2025-03-17 12:09:17,237 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 39 treesize of output 35 [2025-03-17 12:09:17,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:17,244 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-03-17 12:09:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142362058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:17,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:17,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 16] total 26 [2025-03-17 12:09:17,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898154956] [2025-03-17 12:09:17,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:17,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:09:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:17,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:09:17,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2025-03-17 12:09:17,347 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:09:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:17,695 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2025-03-17 12:09:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:09:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-03-17 12:09:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:17,696 INFO L225 Difference]: With dead ends: 107 [2025-03-17 12:09:17,696 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 12:09:17,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 12:09:17,697 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:17,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 861 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 12:09:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-17 12:09:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 96 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:09:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2025-03-17 12:09:17,703 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 35 [2025-03-17 12:09:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:17,704 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2025-03-17 12:09:17,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:09:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2025-03-17 12:09:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:09:17,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:17,704 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, 1, 1, 1] [2025-03-17 12:09:17,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:17,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:17,905 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:17,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash 80139192, now seen corresponding path program 1 times [2025-03-17 12:09:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:17,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865956010] [2025-03-17 12:09:17,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:17,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:09:17,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:09:17,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:17,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865956010] [2025-03-17 12:09:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865956010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612093510] [2025-03-17 12:09:18,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:18,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:18,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:18,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:18,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:09:18,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:09:18,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:09:18,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:18,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:18,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 12:09:18,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:18,199 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-03-17 12:09:18,264 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:09:18,264 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-03-17 12:09:18,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-17 12:09:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:18,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:18,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612093510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:18,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:18,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-17 12:09:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395714348] [2025-03-17 12:09:18,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:18,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 12:09:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:18,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 12:09:18,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:09:18,644 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand has 30 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 24 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:19,007 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2025-03-17 12:09:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:09:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 24 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2025-03-17 12:09:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:19,012 INFO L225 Difference]: With dead ends: 150 [2025-03-17 12:09:19,012 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 12:09:19,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 12:09:19,012 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 108 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:19,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 408 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:09:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 12:09:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2025-03-17 12:09:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 122 states have internal predecessors, (151), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2025-03-17 12:09:19,015 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 36 [2025-03-17 12:09:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:19,016 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2025-03-17 12:09:19,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 24 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2025-03-17 12:09:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:09:19,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:19,016 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, 1, 1, 1] [2025-03-17 12:09:19,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:09:19,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 12:09:19,217 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:19,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash 80139193, now seen corresponding path program 1 times [2025-03-17 12:09:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366833964] [2025-03-17 12:09:19,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:19,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:19,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:09:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:09:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:09:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:19,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366833964] [2025-03-17 12:09:19,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366833964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:19,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:19,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:09:19,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957478417] [2025-03-17 12:09:19,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:19,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:09:19,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:19,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:09:19,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:09:19,315 INFO L87 Difference]: Start difference. First operand 133 states and 167 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-03-17 12:09:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:19,415 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2025-03-17 12:09:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:19,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 36 [2025-03-17 12:09:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:19,416 INFO L225 Difference]: With dead ends: 176 [2025-03-17 12:09:19,416 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 12:09:19,416 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-03-17 12:09:19,417 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:19,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 319 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:09:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 12:09:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2025-03-17 12:09:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.4375) internal successors, (207), 158 states have internal predecessors, (207), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2025-03-17 12:09:19,424 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 36 [2025-03-17 12:09:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:19,424 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2025-03-17 12:09:19,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-03-17 12:09:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2025-03-17 12:09:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:09:19,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:19,424 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, 1, 1, 1] [2025-03-17 12:09:19,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 12:09:19,426 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:19,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash 80138841, now seen corresponding path program 1 times [2025-03-17 12:09:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170541746] [2025-03-17 12:09:19,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:19,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:09:19,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:09:19,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:19,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:09:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170541746] [2025-03-17 12:09:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170541746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:19,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:19,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:09:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487118386] [2025-03-17 12:09:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:19,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:09:19,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:19,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:09:19,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:09:19,513 INFO L87 Difference]: Start difference. First operand 169 states and 223 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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-03-17 12:09:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:19,552 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2025-03-17 12:09:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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 36 [2025-03-17 12:09:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:19,553 INFO L225 Difference]: With dead ends: 176 [2025-03-17 12:09:19,553 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 12:09:19,554 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-03-17 12:09:19,554 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 21 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:19,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 388 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:09:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 12:09:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2025-03-17 12:09:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 145 states have (on average 1.4137931034482758) internal successors, (205), 159 states have internal predecessors, (205), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2025-03-17 12:09:19,558 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 36 [2025-03-17 12:09:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:19,558 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2025-03-17 12:09:19,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 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-03-17 12:09:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2025-03-17 12:09:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:09:19,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:19,559 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, 1, 1, 1, 1, 1] [2025-03-17 12:09:19,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:09:19,559 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:19,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1741071951, now seen corresponding path program 1 times [2025-03-17 12:09:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:19,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813013059] [2025-03-17 12:09:19,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:19,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:09:19,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:09:19,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813013059] [2025-03-17 12:09:19,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813013059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338183843] [2025-03-17 12:09:19,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:19,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:19,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:19,707 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:19,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 12:09:19,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:09:19,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:09:19,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:19,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:19,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:09:19,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:19,810 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-03-17 12:09:19,818 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-03-17 12:09:19,825 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 17 treesize of output 9 [2025-03-17 12:09:19,833 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-03-17 12:09:19,842 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:09:19,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:09:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-17 12:09:19,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:19,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338183843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:19,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:19,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-03-17 12:09:19,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190829133] [2025-03-17 12:09:19,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:19,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 12:09:19,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:19,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 12:09:19,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:09:19,938 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:09:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:20,109 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2025-03-17 12:09:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-17 12:09:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:20,110 INFO L225 Difference]: With dead ends: 169 [2025-03-17 12:09:20,110 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 12:09:20,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-03-17 12:09:20,110 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:20,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 470 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 312 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-03-17 12:09:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 12:09:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-17 12:09:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 145 states have (on average 1.4) internal successors, (203), 158 states have internal predecessors, (203), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 219 transitions. [2025-03-17 12:09:20,115 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 219 transitions. Word has length 40 [2025-03-17 12:09:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:20,116 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 219 transitions. [2025-03-17 12:09:20,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:09:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 219 transitions. [2025-03-17 12:09:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:09:20,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:20,118 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, 1, 1, 1, 1, 1] [2025-03-17 12:09:20,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 12:09:20,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 12:09:20,322 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:20,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1741071950, now seen corresponding path program 1 times [2025-03-17 12:09:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711486714] [2025-03-17 12:09:20,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:20,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:09:20,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:09:20,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:20,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711486714] [2025-03-17 12:09:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711486714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487923908] [2025-03-17 12:09:20,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:20,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:20,538 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:20,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 12:09:20,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:09:20,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:09:20,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:20,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:20,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:09:20,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:20,645 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-03-17 12:09:20,659 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-03-17 12:09:20,660 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-03-17 12:09:20,670 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 17 treesize of output 9 [2025-03-17 12:09:20,681 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-03-17 12:09:20,696 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:09:20,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:09:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-17 12:09:20,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487923908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:20,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:20,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2025-03-17 12:09:20,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468635259] [2025-03-17 12:09:20,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:20,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:09:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:20,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:09:20,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:09:20,763 INFO L87 Difference]: Start difference. First operand 169 states and 219 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:09:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:20,888 INFO L93 Difference]: Finished difference Result 167 states and 215 transitions. [2025-03-17 12:09:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:20,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-03-17 12:09:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:20,889 INFO L225 Difference]: With dead ends: 167 [2025-03-17 12:09:20,889 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 12:09:20,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2025-03-17 12:09:20,890 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:20,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 443 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 215 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-03-17 12:09:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 12:09:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2025-03-17 12:09:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.3884892086330936) internal successors, (193), 150 states have internal predecessors, (193), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:09:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 205 transitions. [2025-03-17 12:09:20,893 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 205 transitions. Word has length 40 [2025-03-17 12:09:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:20,893 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 205 transitions. [2025-03-17 12:09:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:09:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 205 transitions. [2025-03-17 12:09:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:09:20,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:20,893 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, 1, 1, 1, 1] [2025-03-17 12:09:20,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:21,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:21,094 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:21,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2002474690, now seen corresponding path program 1 times [2025-03-17 12:09:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191482827] [2025-03-17 12:09:21,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:21,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:09:21,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:09:21,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:21,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:21,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:21,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191482827] [2025-03-17 12:09:21,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191482827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:21,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485818296] [2025-03-17 12:09:21,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:21,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:21,779 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:21,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 12:09:21,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:09:21,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:09:21,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:21,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:21,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-17 12:09:21,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:21,874 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-03-17 12:09:21,894 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-03-17 12:09:21,898 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-03-17 12:09:21,904 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 19 treesize of output 18 [2025-03-17 12:09:21,912 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 19 treesize of output 18 [2025-03-17 12:09:22,241 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:09:22,241 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-03-17 12:09:22,248 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 16 [2025-03-17 12:09:22,254 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 16 [2025-03-17 12:09:22,421 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-03-17 12:09:22,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:22,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-03-17 12:09:22,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:22,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-03-17 12:09:22,452 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 12:09:22,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 12:09:22,512 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 16 [2025-03-17 12:09:22,514 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 16 [2025-03-17 12:09:22,668 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-17 12:09:22,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2025-03-17 12:09:22,691 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-17 12:09:22,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2025-03-17 12:09:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2025-03-17 12:09:22,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:23,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485818296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:23,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 40 [2025-03-17 12:09:23,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801951730] [2025-03-17 12:09:23,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:23,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 12:09:23,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:23,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 12:09:23,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1665, Unknown=7, NotChecked=82, Total=1892 [2025-03-17 12:09:23,177 INFO L87 Difference]: Start difference. First operand 159 states and 205 transitions. Second operand has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 32 states have internal predecessors, (63), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:23,942 INFO L93 Difference]: Finished difference Result 175 states and 225 transitions. [2025-03-17 12:09:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 12:09:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 32 states have internal predecessors, (63), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-03-17 12:09:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:23,944 INFO L225 Difference]: With dead ends: 175 [2025-03-17 12:09:23,944 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 12:09:23,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=2945, Unknown=7, NotChecked=110, Total=3306 [2025-03-17 12:09:23,945 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:23,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 927 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 825 Invalid, 0 Unknown, 95 Unchecked, 0.4s Time] [2025-03-17 12:09:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 12:09:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2025-03-17 12:09:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 162 states have internal predecessors, (206), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2025-03-17 12:09:23,948 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 40 [2025-03-17 12:09:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:23,948 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2025-03-17 12:09:23,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 32 states have internal predecessors, (63), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2025-03-17 12:09:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:09:23,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:23,949 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, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:23,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 12:09:24,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:09:24,150 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:24,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash -575159686, now seen corresponding path program 1 times [2025-03-17 12:09:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:24,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374351014] [2025-03-17 12:09:24,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:24,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:09:24,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:09:24,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:24,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:09:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374351014] [2025-03-17 12:09:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374351014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:09:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519082274] [2025-03-17 12:09:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:24,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:09:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:24,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:09:24,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:09:24,231 INFO L87 Difference]: Start difference. First operand 172 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-03-17 12:09:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:24,304 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2025-03-17 12:09:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:24,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 39 [2025-03-17 12:09:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:24,306 INFO L225 Difference]: With dead ends: 177 [2025-03-17 12:09:24,306 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 12:09:24,306 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-03-17 12:09:24,306 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:24,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 326 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:09:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 12:09:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2025-03-17 12:09:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 166 states have internal predecessors, (213), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 12:09:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2025-03-17 12:09:24,310 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 39 [2025-03-17 12:09:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2025-03-17 12:09:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-03-17 12:09:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2025-03-17 12:09:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:09:24,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:24,311 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:24,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:09:24,311 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:24,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1006235248, now seen corresponding path program 1 times [2025-03-17 12:09:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604255254] [2025-03-17 12:09:24,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:24,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:09:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:09:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604255254] [2025-03-17 12:09:24,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604255254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542328022] [2025-03-17 12:09:24,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:24,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:24,716 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:24,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 12:09:24,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:09:24,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:09:24,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:24,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:24,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:09:24,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:24,856 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-03-17 12:09:24,888 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-03-17 12:09:24,953 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2025-03-17 12:09:24,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:24,967 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 18 treesize of output 13 [2025-03-17 12:09:24,988 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-03-17 12:09:24,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 12:09:25,026 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 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 12:09:25,030 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 17 treesize of output 9 [2025-03-17 12:09:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:25,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542328022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:25,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:25,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 25 [2025-03-17 12:09:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839205410] [2025-03-17 12:09:25,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:25,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:09:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:25,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:09:25,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2025-03-17 12:09:25,123 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 26 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:25,504 INFO L93 Difference]: Finished difference Result 198 states and 257 transitions. [2025-03-17 12:09:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 12:09:25,505 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-03-17 12:09:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:25,505 INFO L225 Difference]: With dead ends: 198 [2025-03-17 12:09:25,505 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 12:09:25,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=951, Unknown=1, NotChecked=62, Total=1122 [2025-03-17 12:09:25,506 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 14 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:25,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 817 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 641 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2025-03-17 12:09:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 12:09:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-03-17 12:09:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 183 states have internal predecessors, (234), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 12:09:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 252 transitions. [2025-03-17 12:09:25,511 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 252 transitions. Word has length 41 [2025-03-17 12:09:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:25,511 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 252 transitions. [2025-03-17 12:09:25,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 252 transitions. [2025-03-17 12:09:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:09:25,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:25,512 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:25,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:25,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:09:25,716 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:25,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1006235249, now seen corresponding path program 1 times [2025-03-17 12:09:25,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:25,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837342357] [2025-03-17 12:09:25,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:25,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:09:25,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:09:25,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:25,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837342357] [2025-03-17 12:09:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837342357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475022048] [2025-03-17 12:09:26,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:26,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:26,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:26,211 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:26,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 12:09:26,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:09:26,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:09:26,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:26,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:26,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 12:09:26,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:26,334 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-03-17 12:09:26,337 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-03-17 12:09:26,410 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-03-17 12:09:26,415 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-03-17 12:09:26,498 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-03-17 12:09:26,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:26,515 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 20 [2025-03-17 12:09:26,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:26,519 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 18 treesize of output 13 [2025-03-17 12:09:26,530 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-03-17 12:09:26,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 12:09:26,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-03-17 12:09:26,588 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:09:26,592 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 29 treesize of output 13 [2025-03-17 12:09:26,600 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 17 treesize of output 9 [2025-03-17 12:09:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:26,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:26,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475022048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:26,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:26,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 31 [2025-03-17 12:09:26,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860589923] [2025-03-17 12:09:26,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:26,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:09:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:26,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:09:26,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1150, Unknown=1, NotChecked=68, Total=1332 [2025-03-17 12:09:26,858 INFO L87 Difference]: Start difference. First operand 195 states and 252 transitions. Second operand has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:27,379 INFO L93 Difference]: Finished difference Result 198 states and 256 transitions. [2025-03-17 12:09:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 12:09:27,379 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-03-17 12:09:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:27,380 INFO L225 Difference]: With dead ends: 198 [2025-03-17 12:09:27,380 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 12:09:27,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1352, Unknown=1, NotChecked=74, Total=1560 [2025-03-17 12:09:27,381 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:27,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 900 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 707 Invalid, 0 Unknown, 97 Unchecked, 0.3s Time] [2025-03-17 12:09:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 12:09:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2025-03-17 12:09:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 184 states have internal predecessors, (234), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 12:09:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 252 transitions. [2025-03-17 12:09:27,388 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 252 transitions. Word has length 41 [2025-03-17 12:09:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:27,389 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 252 transitions. [2025-03-17 12:09:27,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2025-03-17 12:09:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:09:27,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:27,389 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, 1, 1, 1] [2025-03-17 12:09:27,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 12:09:27,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 12:09:27,590 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:27,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1947165374, now seen corresponding path program 1 times [2025-03-17 12:09:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:27,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646597314] [2025-03-17 12:09:27,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:27,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:09:27,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:09:27,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:27,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:09:27,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646597314] [2025-03-17 12:09:27,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646597314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348585444] [2025-03-17 12:09:27,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:27,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:27,727 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:27,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 12:09:27,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:09:27,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:09:27,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:27,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:27,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 12:09:27,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:27,848 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-03-17 12:09:27,851 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-03-17 12:09:27,988 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:27,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:09:27,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:27,998 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-03-17 12:09:28,071 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:28,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:09:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:28,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:28,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348585444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:28,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 23 [2025-03-17 12:09:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859875812] [2025-03-17 12:09:28,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:28,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 12:09:28,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:28,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 12:09:28,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-03-17 12:09:28,343 INFO L87 Difference]: Start difference. First operand 196 states and 252 transitions. Second operand has 24 states, 22 states have (on average 2.909090909090909) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:28,677 INFO L93 Difference]: Finished difference Result 198 states and 244 transitions. [2025-03-17 12:09:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:09:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.909090909090909) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-17 12:09:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:28,678 INFO L225 Difference]: With dead ends: 198 [2025-03-17 12:09:28,678 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 12:09:28,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 12:09:28,679 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:28,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 539 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 12:09:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2025-03-17 12:09:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 171 states have (on average 1.2982456140350878) internal successors, (222), 182 states have internal predecessors, (222), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 12:09:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 240 transitions. [2025-03-17 12:09:28,683 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 240 transitions. Word has length 41 [2025-03-17 12:09:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:28,683 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 240 transitions. [2025-03-17 12:09:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.909090909090909) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2025-03-17 12:09:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:09:28,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:28,684 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, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:28,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:28,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:28,884 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:28,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1128513743, now seen corresponding path program 1 times [2025-03-17 12:09:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:28,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689263863] [2025-03-17 12:09:28,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:28,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:09:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:09:28,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:28,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:09:28,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:28,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689263863] [2025-03-17 12:09:28,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689263863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:28,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260539516] [2025-03-17 12:09:28,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:28,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:28,932 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:28,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 12:09:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:09:29,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:09:29,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:29,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:29,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 12:09:29,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:29,063 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-17 12:09:29,081 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:09:29,082 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-03-17 12:09:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:09:29,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260539516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:29,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 9 [2025-03-17 12:09:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989429897] [2025-03-17 12:09:29,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:29,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:09:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:29,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:09:29,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:09:29,130 INFO L87 Difference]: Start difference. First operand 194 states and 240 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:29,233 INFO L93 Difference]: Finished difference Result 196 states and 240 transitions. [2025-03-17 12:09:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2025-03-17 12:09:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:29,235 INFO L225 Difference]: With dead ends: 196 [2025-03-17 12:09:29,235 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 12:09:29,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:09:29,235 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 14 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:29,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 326 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 140 Unchecked, 0.1s Time] [2025-03-17 12:09:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 12:09:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2025-03-17 12:09:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 160 states have internal predecessors, (190), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 206 transitions. [2025-03-17 12:09:29,240 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 206 transitions. Word has length 42 [2025-03-17 12:09:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:29,240 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 206 transitions. [2025-03-17 12:09:29,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 206 transitions. [2025-03-17 12:09:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:09:29,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:29,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:29,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:29,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:29,444 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:29,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1957679439, now seen corresponding path program 1 times [2025-03-17 12:09:29,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:29,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203018273] [2025-03-17 12:09:29,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:29,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:09:29,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:09:29,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:29,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:30,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203018273] [2025-03-17 12:09:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203018273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761511583] [2025-03-17 12:09:30,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:30,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:30,058 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:30,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 12:09:30,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:09:30,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:09:30,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:30,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:30,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 12:09:30,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:30,173 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-03-17 12:09:30,296 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-03-17 12:09:30,300 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-03-17 12:09:30,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:30,361 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-03-17 12:09:30,446 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-03-17 12:09:30,450 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-03-17 12:09:30,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:30,545 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-03-17 12:09:30,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:30,549 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-03-17 12:09:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:30,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:30,785 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1383 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_set_~x#1.base| v_ArrVal_1383) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_1384 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_set_~x#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2025-03-17 12:09:30,877 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1383 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1383) |c_ULTIMATE.start_create_internal_#t~ret5#1.base|) 0) 0)) (forall ((v_ArrVal_1384 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_create_internal_#t~ret5#1.base|) 0)))) is different from false [2025-03-17 12:09:30,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:30,918 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 37 treesize of output 38 [2025-03-17 12:09:30,921 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 50 treesize of output 42 [2025-03-17 12:09:30,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:30,926 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 29 treesize of output 30 [2025-03-17 12:09:30,929 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 42 treesize of output 34 [2025-03-17 12:09:30,931 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 21 treesize of output 19 [2025-03-17 12:09:30,934 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 19 treesize of output 17 [2025-03-17 12:09:35,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:35,095 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-03-17 12:09:35,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:35,100 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-03-17 12:09:35,107 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-03-17 12:09:35,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:35,119 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-03-17 12:09:35,120 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:35,124 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:09:35,124 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-03-17 12:09:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-17 12:09:35,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761511583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:35,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 20] total 59 [2025-03-17 12:09:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055363035] [2025-03-17 12:09:35,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:35,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-17 12:09:35,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:35,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-17 12:09:35,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2982, Unknown=52, NotChecked=222, Total=3422 [2025-03-17 12:09:35,320 INFO L87 Difference]: Start difference. First operand 171 states and 206 transitions. Second operand has 59 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 50 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:37,193 INFO L93 Difference]: Finished difference Result 196 states and 229 transitions. [2025-03-17 12:09:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 12:09:37,194 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 50 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-03-17 12:09:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:37,194 INFO L225 Difference]: With dead ends: 196 [2025-03-17 12:09:37,194 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 12:09:37,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=448, Invalid=6988, Unknown=54, NotChecked=342, Total=7832 [2025-03-17 12:09:37,196 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 173 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:37,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1109 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1780 Invalid, 0 Unknown, 252 Unchecked, 0.9s Time] [2025-03-17 12:09:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 12:09:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2025-03-17 12:09:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 167 states have internal predecessors, (197), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2025-03-17 12:09:37,202 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 42 [2025-03-17 12:09:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:37,203 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2025-03-17 12:09:37,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 50 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2025-03-17 12:09:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:09:37,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:37,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:37,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-17 12:09:37,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 12:09:37,405 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:37,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1957679790, now seen corresponding path program 1 times [2025-03-17 12:09:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:37,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793425117] [2025-03-17 12:09:37,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:37,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:09:37,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:09:37,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:37,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793425117] [2025-03-17 12:09:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793425117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827321511] [2025-03-17 12:09:37,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:37,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:37,825 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:37,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 12:09:37,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:09:37,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:09:37,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:37,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 12:09:37,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:38,141 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:09:38,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2025-03-17 12:09:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:38,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:38,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827321511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:38,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:38,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2025-03-17 12:09:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96481323] [2025-03-17 12:09:38,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:38,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 12:09:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:38,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 12:09:38,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 12:09:38,566 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 24 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:09:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:38,860 INFO L93 Difference]: Finished difference Result 193 states and 227 transitions. [2025-03-17 12:09:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 12:09:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 24 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2025-03-17 12:09:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:38,861 INFO L225 Difference]: With dead ends: 193 [2025-03-17 12:09:38,861 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 12:09:38,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 12:09:38,862 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:38,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 546 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:09:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 12:09:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-17 12:09:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 161 states have internal predecessors, (190), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2025-03-17 12:09:38,866 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 42 [2025-03-17 12:09:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2025-03-17 12:09:38,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 24 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:09:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2025-03-17 12:09:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 12:09:38,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:38,868 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, 1, 1, 1, 1] [2025-03-17 12:09:38,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-17 12:09:39,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-17 12:09:39,073 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:39,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1216316116, now seen corresponding path program 2 times [2025-03-17 12:09:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567376408] [2025-03-17 12:09:39,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:09:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:39,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 12:09:39,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:09:39,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:09:39,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567376408] [2025-03-17 12:09:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567376408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071594720] [2025-03-17 12:09:39,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:09:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:39,979 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:39,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 12:09:40,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 12:09:40,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:09:40,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:09:40,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:40,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-17 12:09:40,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:40,110 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-03-17 12:09:40,238 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-03-17 12:09:40,241 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-03-17 12:09:40,273 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 19 treesize of output 18 [2025-03-17 12:09:40,280 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 19 treesize of output 18 [2025-03-17 12:09:40,378 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:09:40,378 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-03-17 12:09:40,458 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 38 treesize of output 29 [2025-03-17 12:09:40,464 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 38 treesize of output 29 [2025-03-17 12:09:40,727 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base) 0 0))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-03-17 12:09:40,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:40,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:40,749 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:40,757 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-17 12:09:40,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 61 [2025-03-17 12:09:40,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:40,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:40,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2025-03-17 12:09:40,780 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 12:09:40,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 12:09:41,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,034 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,035 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,044 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-17 12:09:41,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 72 [2025-03-17 12:09:41,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2025-03-17 12:09:41,468 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,470 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,492 INFO L349 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2025-03-17 12:09:41,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 70 [2025-03-17 12:09:41,498 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,502 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,503 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,540 INFO L349 Elim1Store]: treesize reduction 148, result has 24.5 percent of original size [2025-03-17 12:09:41,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 104 [2025-03-17 12:09:41,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,683 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,683 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,684 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,684 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:09:41,693 INFO L349 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2025-03-17 12:09:41,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 136 treesize of output 77 [2025-03-17 12:09:41,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:41,712 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2025-03-17 12:09:41,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 29 [2025-03-17 12:09:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:41,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071594720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:42,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 45 [2025-03-17 12:09:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834224256] [2025-03-17 12:09:42,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:42,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-17 12:09:42,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:42,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-17 12:09:42,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2304, Unknown=1, NotChecked=96, Total=2550 [2025-03-17 12:09:42,439 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 39 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:48,805 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2025-03-17 12:09:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 12:09:48,806 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 39 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2025-03-17 12:09:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:48,806 INFO L225 Difference]: With dead ends: 176 [2025-03-17 12:09:48,806 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 12:09:48,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=237, Invalid=3797, Unknown=2, NotChecked=124, Total=4160 [2025-03-17 12:09:48,808 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 17 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:48,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1643 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1488 Invalid, 0 Unknown, 99 Unchecked, 1.1s Time] [2025-03-17 12:09:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 12:09:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2025-03-17 12:09:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 152 states have (on average 1.263157894736842) internal successors, (192), 163 states have internal predecessors, (192), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:09:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2025-03-17 12:09:48,811 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 45 [2025-03-17 12:09:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:48,811 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2025-03-17 12:09:48,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 39 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:09:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2025-03-17 12:09:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:09:48,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:48,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:09:48,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 12:09:49,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:49,012 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:49,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1915250210, now seen corresponding path program 1 times [2025-03-17 12:09:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078274839] [2025-03-17 12:09:49,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:49,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:09:49,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:09:49,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:49,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:09:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078274839] [2025-03-17 12:09:49,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078274839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295881187] [2025-03-17 12:09:49,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:49,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:49,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:49,172 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:49,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 12:09:49,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:09:49,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:09:49,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:49,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:49,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:09:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:09:49,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:49,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:49,543 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 19 treesize of output 23 [2025-03-17 12:09:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:09:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295881187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:49,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:49,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-17 12:09:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356680947] [2025-03-17 12:09:49,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:49,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:09:49,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:49,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:09:49,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:09:49,615 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 17 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:49,794 INFO L93 Difference]: Finished difference Result 225 states and 267 transitions. [2025-03-17 12:09:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:49,795 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2025-03-17 12:09:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:49,795 INFO L225 Difference]: With dead ends: 225 [2025-03-17 12:09:49,796 INFO L226 Difference]: Without dead ends: 225 [2025-03-17 12:09:49,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:09:49,796 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:49,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 710 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-17 12:09:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2025-03-17 12:09:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 171 states have (on average 1.2456140350877194) internal successors, (213), 182 states have internal predecessors, (213), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 12:09:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2025-03-17 12:09:49,799 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 48 [2025-03-17 12:09:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:49,800 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2025-03-17 12:09:49,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:09:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2025-03-17 12:09:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 12:09:49,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:49,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2025-03-17 12:09:49,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 12:09:50,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:50,005 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-17 12:09:50,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash -526220697, now seen corresponding path program 2 times [2025-03-17 12:09:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469417538] [2025-03-17 12:09:50,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:09:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:50,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-17 12:09:50,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:09:50,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:09:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:51,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469417538] [2025-03-17 12:09:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469417538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412784827] [2025-03-17 12:09:51,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:09:51,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:51,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:51,485 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:09:51,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 12:09:51,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-17 12:09:51,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:09:51,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:09:51,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:51,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-17 12:09:51,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:51,623 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-03-17 12:09:51,627 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-03-17 12:09:51,672 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 19 treesize of output 18 [2025-03-17 12:09:51,680 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 19 treesize of output 18 [2025-03-17 12:09:51,959 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-03-17 12:09:51,965 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-03-17 12:09:52,141 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:52,141 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 23 treesize of output 20 [2025-03-17 12:09:52,159 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:52,160 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 23 treesize of output 20 [2025-03-17 12:09:52,633 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:52,633 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 28 treesize of output 25 [2025-03-17 12:09:52,656 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:52,656 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 28 treesize of output 25 [2025-03-17 12:09:52,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:52,672 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-03-17 12:09:52,676 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 12 treesize of output 14 [2025-03-17 12:09:52,767 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:52,767 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 35 treesize of output 32 [2025-03-17 12:09:52,810 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2025-03-17 12:09:52,811 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 2 case distinctions, treesize of input 42 treesize of output 49 [2025-03-17 12:09:53,577 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-03-17 12:09:53,706 INFO L349 Elim1Store]: treesize reduction 48, result has 63.9 percent of original size [2025-03-17 12:09:53,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 204 treesize of output 242 [2025-03-17 12:09:54,187 INFO L349 Elim1Store]: treesize reduction 110, result has 81.0 percent of original size [2025-03-17 12:09:54,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 164 treesize of output 602 [2025-03-17 12:09:54,223 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:09:54,224 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 136 treesize of output 133