./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll.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-nested-sll.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 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:08:38,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:08:38,268 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:38,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:08:38,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:08:38,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:08:38,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:08:38,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:08:38,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:08:38,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:08:38,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:08:38,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:08:38,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:08:38,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:08:38,305 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:08:38,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:08:38,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:08:38,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:08:38,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:08:38,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:08:38,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:08:38,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:38,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:08:38,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:08:38,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:08:38,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:08:38,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:08:38,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:08:38,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:08:38,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:08:38,308 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 -> 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e [2025-03-17 12:08:38,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:08:38,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:08:38,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:08:38,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:08:38,576 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:08:38,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2025-03-17 12:08:39,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700b7e77a/70b7aa2d069b48f288c72e33bd10b8fa/FLAG1dec5c00c [2025-03-17 12:08:39,992 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:08:39,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2025-03-17 12:08:40,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700b7e77a/70b7aa2d069b48f288c72e33bd10b8fa/FLAG1dec5c00c [2025-03-17 12:08:40,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700b7e77a/70b7aa2d069b48f288c72e33bd10b8fa [2025-03-17 12:08:40,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:08:40,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:08:40,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:40,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:08:40,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:08:40,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:40" (1/1) ... [2025-03-17 12:08:40,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcd4b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:40, skipping insertion in model container [2025-03-17 12:08:40,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:40" (1/1) ... [2025-03-17 12:08:40,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:08:40,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:40,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:08:40,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:40,623 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:08:40,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:40 WrapperNode [2025-03-17 12:08:40,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:40,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:40,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:08:40,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:08:40,630 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:40" (1/1) ... [2025-03-17 12:08:40,641 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:40" (1/1) ... [2025-03-17 12:08:40,659 INFO L138 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 76 [2025-03-17 12:08:40,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:40,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:08:40,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:08:40,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:08:40,665 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:40" (1/1) ... [2025-03-17 12:08:40,666 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:40" (1/1) ... [2025-03-17 12:08:40,669 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:40" (1/1) ... [2025-03-17 12:08:40,687 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2025-03-17 12:08:40,688 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:40" (1/1) ... [2025-03-17 12:08:40,688 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:40" (1/1) ... [2025-03-17 12:08:40,692 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:40" (1/1) ... [2025-03-17 12:08:40,693 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:40" (1/1) ... [2025-03-17 12:08:40,694 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:40" (1/1) ... [2025-03-17 12:08:40,694 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:40" (1/1) ... [2025-03-17 12:08:40,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:08:40,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:08:40,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:08:40,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:08:40,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:40" (1/1) ... [2025-03-17 12:08:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:40,726 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:40,729 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:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-03-17 12:08:40,747 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-03-17 12:08:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2025-03-17 12:08:40,747 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2025-03-17 12:08:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-17 12:08:40,747 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-17 12:08:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:08:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:08:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:08:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:08:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:08:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:08:40,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:08:40,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:08:41,108 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-17 12:08:41,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:08:41,121 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:08:41,123 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:08:41,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:41 BoogieIcfgContainer [2025-03-17 12:08:41,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:08:41,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:08:41,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:08:41,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:08:41,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:08:40" (1/3) ... [2025-03-17 12:08:41,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d5083d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:41, skipping insertion in model container [2025-03-17 12:08:41,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:40" (2/3) ... [2025-03-17 12:08:41,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d5083d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:41, skipping insertion in model container [2025-03-17 12:08:41,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:41" (3/3) ... [2025-03-17 12:08:41,132 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll.i [2025-03-17 12:08:41,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:08:41,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll.i that has 4 procedures, 105 locations, 1 initial locations, 6 loop locations, and 39 error locations. [2025-03-17 12:08:41,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:08:41,177 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;@22add118, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:08:41,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-17 12:08:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 95 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:08:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:41,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:41,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:41,185 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 36 more)] === [2025-03-17 12:08:41,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 3536702, now seen corresponding path program 1 times [2025-03-17 12:08:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:41,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506424615] [2025-03-17 12:08:41,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:41,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:41,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:41,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:41,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,344 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:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506424615] [2025-03-17 12:08:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506424615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:41,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210389847] [2025-03-17 12:08:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:41,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:41,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:41,380 INFO L87 Difference]: Start difference. First operand has 105 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 95 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:41,462 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-03-17 12:08:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:41,464 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:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:41,470 INFO L225 Difference]: With dead ends: 103 [2025-03-17 12:08:41,470 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:08:41,472 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:41,474 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:41,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 175 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:08:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 12:08:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 91 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:08:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-03-17 12:08:41,502 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 4 [2025-03-17 12:08:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:41,502 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-03-17 12:08:41,502 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:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-03-17 12:08:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:41,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:41,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:41,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:08:41,503 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 36 more)] === [2025-03-17 12:08:41,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash 3536703, now seen corresponding path program 1 times [2025-03-17 12:08:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22957636] [2025-03-17 12:08:41,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:41,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:41,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:41,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:41,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:41,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,603 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:41,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:41,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22957636] [2025-03-17 12:08:41,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22957636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:41,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:41,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123378744] [2025-03-17 12:08:41,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:41,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:41,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:41,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:41,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:41,606 INFO L87 Difference]: Start difference. First operand 101 states and 109 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:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:41,654 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2025-03-17 12:08:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:41,655 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:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:41,655 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:08:41,655 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:08:41,656 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:41,656 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:41,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 178 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:08:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 12:08:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 89 states have internal predecessors, (95), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:08:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-03-17 12:08:41,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 4 [2025-03-17 12:08:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:41,661 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-03-17 12:08:41,662 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:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-03-17 12:08:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:08:41,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:41,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:41,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:08:41,662 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 36 more)] === [2025-03-17 12:08:41,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2093941330, now seen corresponding path program 1 times [2025-03-17 12:08:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:41,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533014560] [2025-03-17 12:08:41,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:41,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:08:41,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:08:41,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:41,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,758 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:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533014560] [2025-03-17 12:08:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533014560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:41,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633101364] [2025-03-17 12:08:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:41,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:41,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:41,760 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:41,815 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2025-03-17 12:08:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:41,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-17 12:08:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:41,817 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:08:41,817 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:08:41,817 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:41,817 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:41,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:08:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 12:08:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.709090909090909) internal successors, (94), 88 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:08:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-03-17 12:08:41,822 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 13 [2025-03-17 12:08:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:41,823 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-03-17 12:08:41,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-03-17 12:08:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:08:41,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:41,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:41,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:08:41,824 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 36 more)] === [2025-03-17 12:08:41,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2093941329, now seen corresponding path program 1 times [2025-03-17 12:08:41,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:41,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056331611] [2025-03-17 12:08:41,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:41,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:41,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:08:41,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:08:41,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:41,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,911 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:41,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:41,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056331611] [2025-03-17 12:08:41,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056331611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:41,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:41,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:41,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597195921] [2025-03-17 12:08:41,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:41,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:41,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:41,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:41,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:41,914 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:41,964 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-03-17 12:08:41,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:41,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-17 12:08:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:41,966 INFO L225 Difference]: With dead ends: 97 [2025-03-17 12:08:41,966 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 12:08:41,967 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:41,967 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:41,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 176 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 12:08:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 12:08:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.690909090909091) internal successors, (93), 87 states have internal predecessors, (93), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:08:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-03-17 12:08:41,980 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 13 [2025-03-17 12:08:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:41,980 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-03-17 12:08:41,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-03-17 12:08:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:41,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:41,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:41,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:08:41,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:41,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash -6980655, now seen corresponding path program 1 times [2025-03-17 12:08:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933025883] [2025-03-17 12:08:41,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:41,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:42,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:42,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:42,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:42,393 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:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933025883] [2025-03-17 12:08:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933025883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:08:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366814438] [2025-03-17 12:08:42,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:42,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:08:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:42,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:08:42,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:08:42,394 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:42,752 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2025-03-17 12:08:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2025-03-17 12:08:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:42,755 INFO L225 Difference]: With dead ends: 118 [2025-03-17 12:08:42,755 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 12:08:42,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:08:42,755 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:42,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 502 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:08:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 12:08:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-03-17 12:08:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 101 states have internal predecessors, (114), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-17 12:08:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2025-03-17 12:08:42,762 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 23 [2025-03-17 12:08:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:42,763 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2025-03-17 12:08:42,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2025-03-17 12:08:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:08:42,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:42,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:08:42,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:42,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash -6980656, now seen corresponding path program 1 times [2025-03-17 12:08:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:42,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148906432] [2025-03-17 12:08:42,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:42,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:08:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:08:42,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:42,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:43,003 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:43,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:43,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148906432] [2025-03-17 12:08:43,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148906432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:43,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:08:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115016250] [2025-03-17 12:08:43,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:43,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:08:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:43,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:08:43,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:08:43,009 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:43,272 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2025-03-17 12:08:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:08:43,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2025-03-17 12:08:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:43,273 INFO L225 Difference]: With dead ends: 124 [2025-03-17 12:08:43,273 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 12:08:43,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:08:43,274 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:43,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 376 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 12:08:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-03-17 12:08:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 105 states have internal predecessors, (121), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-17 12:08:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2025-03-17 12:08:43,281 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 23 [2025-03-17 12:08:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:43,281 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2025-03-17 12:08:43,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2025-03-17 12:08:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:08:43,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:43,282 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] [2025-03-17 12:08:43,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:08:43,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:43,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash 922659778, now seen corresponding path program 1 times [2025-03-17 12:08:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771138546] [2025-03-17 12:08:43,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:43,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:08:43,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:08:43,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:43,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:43,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:43,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771138546] [2025-03-17 12:08:43,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771138546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:43,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275553545] [2025-03-17 12:08:43,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:43,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:43,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:43,496 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:43,497 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:08:43,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:08:43,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:08:43,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:43,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:43,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:08:43,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:43,605 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:08:43,632 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:08:43,674 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:08:43,674 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:08:43,679 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:08:43,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275553545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:43,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-17 12:08:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345761813] [2025-03-17 12:08:43,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:08:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:43,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:08:43,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:08:43,741 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:08:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:43,994 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2025-03-17 12:08:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:08:43,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-17 12:08:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:43,995 INFO L225 Difference]: With dead ends: 121 [2025-03-17 12:08:43,995 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 12:08:43,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-03-17 12:08:43,996 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 15 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:43,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 412 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 278 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2025-03-17 12:08:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 12:08:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-17 12:08:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.605263157894737) internal successors, (122), 105 states have internal predecessors, (122), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-17 12:08:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2025-03-17 12:08:44,004 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 26 [2025-03-17 12:08:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:44,004 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2025-03-17 12:08:44,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:08:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2025-03-17 12:08:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:08:44,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:44,008 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] [2025-03-17 12:08:44,015 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:08:44,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:44,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:44,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash 922659779, now seen corresponding path program 1 times [2025-03-17 12:08:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:44,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865429351] [2025-03-17 12:08:44,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:44,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:08:44,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:08:44,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:44,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:44,429 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:08:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865429351] [2025-03-17 12:08:44,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865429351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653491407] [2025-03-17 12:08:44,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:44,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:44,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:44,432 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:08:44,433 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:08:44,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:08:44,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:08:44,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:44,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:44,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:08:44,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:44,503 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:08:44,548 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:08:44,572 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:08:44,572 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:08:44,582 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:08:44,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653491407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:44,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-03-17 12:08:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338879315] [2025-03-17 12:08:44,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:44,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:08:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:08:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:08:44,641 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:08:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:44,858 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2025-03-17 12:08:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-17 12:08:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:44,859 INFO L225 Difference]: With dead ends: 123 [2025-03-17 12:08:44,859 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 12:08:44,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2025-03-17 12:08:44,860 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:44,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 526 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 272 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2025-03-17 12:08:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 12:08:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-17 12:08:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 107 states have internal predecessors, (123), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-17 12:08:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2025-03-17 12:08:44,872 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 26 [2025-03-17 12:08:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:44,873 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2025-03-17 12:08:44,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:08:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2025-03-17 12:08:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:08:44,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:44,874 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:08:44,881 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:08:45,075 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,SelfDestructingSolverStorable7 [2025-03-17 12:08:45,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:45,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 673163224, now seen corresponding path program 1 times [2025-03-17 12:08:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146224683] [2025-03-17 12:08:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:45,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:08:45,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:08:45,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:45,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:45,145 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:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:45,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146224683] [2025-03-17 12:08:45,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146224683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:45,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:45,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:08:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411554552] [2025-03-17 12:08:45,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:45,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:08:45,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:45,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:08:45,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:08:45,148 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:45,242 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2025-03-17 12:08:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-17 12:08:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:45,243 INFO L225 Difference]: With dead ends: 142 [2025-03-17 12:08:45,243 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 12:08:45,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:45,244 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 26 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:45,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 263 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 12:08:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2025-03-17 12:08:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 119 states have internal predecessors, (147), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-17 12:08:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2025-03-17 12:08:45,253 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 29 [2025-03-17 12:08:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:45,253 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2025-03-17 12:08:45,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2025-03-17 12:08:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:08:45,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:45,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:45,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:08:45,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:45,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 673163225, now seen corresponding path program 1 times [2025-03-17 12:08:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746225712] [2025-03-17 12:08:45,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:45,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:08:45,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:08:45,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:45,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:45,381 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:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:45,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746225712] [2025-03-17 12:08:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746225712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:45,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759084136] [2025-03-17 12:08:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:45,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:45,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:45,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:45,382 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:45,506 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2025-03-17 12:08:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:45,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-17 12:08:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:45,509 INFO L225 Difference]: With dead ends: 149 [2025-03-17 12:08:45,509 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 12:08:45,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:08:45,509 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 21 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:45,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 515 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 12:08:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2025-03-17 12:08:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.59) internal successors, (159), 127 states have internal predecessors, (159), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-17 12:08:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2025-03-17 12:08:45,515 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 29 [2025-03-17 12:08:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:45,515 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2025-03-17 12:08:45,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2025-03-17 12:08:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:08:45,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:45,515 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:08:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:08:45,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:45,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash -606791349, now seen corresponding path program 1 times [2025-03-17 12:08:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524069257] [2025-03-17 12:08:45,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:45,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:08:45,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:08:45,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:45,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:45,580 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:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524069257] [2025-03-17 12:08:45,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524069257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:45,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612875463] [2025-03-17 12:08:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:45,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:45,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:45,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:45,582 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:45,618 INFO L93 Difference]: Finished difference Result 154 states and 196 transitions. [2025-03-17 12:08:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-17 12:08:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:45,620 INFO L225 Difference]: With dead ends: 154 [2025-03-17 12:08:45,621 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 12:08:45,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:45,621 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:45,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 530 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 12:08:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2025-03-17 12:08:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 101 states have (on average 1.5643564356435644) internal successors, (158), 128 states have internal predecessors, (158), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-17 12:08:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2025-03-17 12:08:45,628 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 30 [2025-03-17 12:08:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:45,629 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2025-03-17 12:08:45,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2025-03-17 12:08:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:08:45,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:45,631 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:08:45,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:08:45,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:45,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1003320986, now seen corresponding path program 1 times [2025-03-17 12:08:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:45,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565972469] [2025-03-17 12:08:45,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:45,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:08:45,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:08:45,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:45,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:46,133 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:46,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565972469] [2025-03-17 12:08:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565972469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:46,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:46,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 12:08:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45163441] [2025-03-17 12:08:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:46,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:08:46,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:46,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:08:46,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:08:46,135 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:46,492 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2025-03-17 12:08:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:08:46,492 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-17 12:08:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:46,493 INFO L225 Difference]: With dead ends: 160 [2025-03-17 12:08:46,493 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 12:08:46,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:08:46,494 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 31 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:46,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 872 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:08:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 12:08:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-03-17 12:08:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 107 states have (on average 1.5514018691588785) internal successors, (166), 134 states have internal predecessors, (166), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-17 12:08:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2025-03-17 12:08:46,503 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 32 [2025-03-17 12:08:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:46,503 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2025-03-17 12:08:46,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2025-03-17 12:08:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:08:46,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:46,504 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:08:46,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:08:46,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:46,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1003320985, now seen corresponding path program 1 times [2025-03-17 12:08:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:46,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226912259] [2025-03-17 12:08:46,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:08:46,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:08:46,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:46,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:46,810 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:46,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:46,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226912259] [2025-03-17 12:08:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226912259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 12:08:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373836683] [2025-03-17 12:08:46,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:46,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:08:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:46,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:08:46,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:08:46,812 INFO L87 Difference]: Start difference. First operand 152 states and 192 transitions. Second operand has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:47,122 INFO L93 Difference]: Finished difference Result 160 states and 198 transitions. [2025-03-17 12:08:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:08:47,124 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-17 12:08:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:47,125 INFO L225 Difference]: With dead ends: 160 [2025-03-17 12:08:47,125 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 12:08:47,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:08:47,125 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 30 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:47,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 837 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:08:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 12:08:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-03-17 12:08:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 107 states have (on average 1.5420560747663552) internal successors, (165), 134 states have internal predecessors, (165), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-17 12:08:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 191 transitions. [2025-03-17 12:08:47,132 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 191 transitions. Word has length 32 [2025-03-17 12:08:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 191 transitions. [2025-03-17 12:08:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:08:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 191 transitions. [2025-03-17 12:08:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:47,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:47,133 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] [2025-03-17 12:08:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:08:47,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1111423084, now seen corresponding path program 1 times [2025-03-17 12:08:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:47,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327736218] [2025-03-17 12:08:47,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:47,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:47,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:47,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:47,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:47,575 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:08:47,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:47,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327736218] [2025-03-17 12:08:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327736218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337798522] [2025-03-17 12:08:47,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:47,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:47,578 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:08:47,579 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:08:47,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:47,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:47,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:47,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:47,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 12:08:47,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:47,668 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:08:47,672 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:08:47,937 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:08:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:48,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-17 12:08:48,098 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 12:08:48,098 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:08:48,118 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:08:48,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337798522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:48,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:48,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-17 12:08:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250996543] [2025-03-17 12:08:48,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:48,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 12:08:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:48,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 12:08:48,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=557, Unknown=1, NotChecked=48, Total=702 [2025-03-17 12:08:48,317 INFO L87 Difference]: Start difference. First operand 152 states and 191 transitions. Second operand has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 12:08:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:48,801 INFO L93 Difference]: Finished difference Result 179 states and 230 transitions. [2025-03-17 12:08:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:08:48,802 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 35 [2025-03-17 12:08:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:48,805 INFO L225 Difference]: With dead ends: 179 [2025-03-17 12:08:48,805 INFO L226 Difference]: Without dead ends: 179 [2025-03-17 12:08:48,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=646, Unknown=1, NotChecked=52, Total=812 [2025-03-17 12:08:48,806 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 52 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:48,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 613 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 677 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2025-03-17 12:08:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-17 12:08:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2025-03-17 12:08:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 145 states have internal predecessors, (183), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:08:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 213 transitions. [2025-03-17 12:08:48,811 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 213 transitions. Word has length 35 [2025-03-17 12:08:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:48,811 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 213 transitions. [2025-03-17 12:08:48,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 12:08:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2025-03-17 12:08:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:48,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:48,812 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] [2025-03-17 12:08:48,819 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:08:49,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:49,016 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:49,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1111423083, now seen corresponding path program 1 times [2025-03-17 12:08:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730705902] [2025-03-17 12:08:49,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:49,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:49,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:49,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:49,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:08:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:49,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730705902] [2025-03-17 12:08:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730705902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:49,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766023319] [2025-03-17 12:08:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:49,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:49,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:49,380 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:08:49,381 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:08:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:49,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:49,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:49,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:49,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 12:08:49,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:49,455 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:08:49,509 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:08:49,535 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0)) |v_old(#valid)_AFTER_CALL_13|)))) (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 false [2025-03-17 12:08:49,536 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0)) |v_old(#valid)_AFTER_CALL_13|)))) (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:08:49,554 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0)) |v_old(#valid)_AFTER_CALL_13|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (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 false [2025-03-17 12:08:49,556 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0)) |v_old(#valid)_AFTER_CALL_13|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (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:08:49,661 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:08:49,661 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:08:49,674 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_13| (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0))) (= 1 (select |c_#valid| .cse0))))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2025-03-17 12:08:49,675 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_13| (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0))) (= 1 (select |c_#valid| .cse0))))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2025-03-17 12:08:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-17 12:08:49,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766023319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:49,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:49,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2025-03-17 12:08:49,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250812144] [2025-03-17 12:08:49,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:49,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 12:08:49,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:49,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 12:08:49,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=240, Unknown=7, NotChecked=140, Total=462 [2025-03-17 12:08:49,866 INFO L87 Difference]: Start difference. First operand 165 states and 213 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:08:50,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= .cse1 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_13| .cse1)) |v_old(#valid)_AFTER_CALL_13|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-03-17 12:08:50,130 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= .cse1 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_13| .cse1)) |v_old(#valid)_AFTER_CALL_13|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-03-17 12:08:50,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0)) |v_old(#valid)_AFTER_CALL_13|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-03-17 12:08:50,139 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_13| .cse0)) |v_old(#valid)_AFTER_CALL_13|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-03-17 12:08:50,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_13| (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_13| .cse1))) (= 1 (select |c_#valid| .cse1))))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2025-03-17 12:08:50,147 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_13|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_13| alloc_and_zero_internal_~pi~1.base 1)) (= |v_old(#valid)_AFTER_CALL_13| (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_13| .cse1))) (= 1 (select |c_#valid| .cse1))))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2025-03-17 12:08:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:50,271 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2025-03-17 12:08:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:08:50,271 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-03-17 12:08:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:50,272 INFO L225 Difference]: With dead ends: 170 [2025-03-17 12:08:50,272 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 12:08:50,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=393, Unknown=13, NotChecked=336, Total=870 [2025-03-17 12:08:50,273 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:50,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 556 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 497 Invalid, 0 Unknown, 701 Unchecked, 0.3s Time] [2025-03-17 12:08:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 12:08:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2025-03-17 12:08:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 119 states have (on average 1.5294117647058822) internal successors, (182), 145 states have internal predecessors, (182), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:08:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2025-03-17 12:08:50,277 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 35 [2025-03-17 12:08:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:50,277 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2025-03-17 12:08:50,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:08:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2025-03-17 12:08:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:08:50,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:50,279 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:08:50,285 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:08:50,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 12:08:50,479 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:08:50,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:50,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1258066292, now seen corresponding path program 1 times [2025-03-17 12:08:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795835757] [2025-03-17 12:08:50,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:50,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:50,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:50,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:50,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:51,072 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:08:51,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:51,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795835757] [2025-03-17 12:08:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795835757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003840397] [2025-03-17 12:08:51,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:51,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:51,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:51,075 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:08:51,076 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:08:51,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:08:51,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:08:51,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:51,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:51,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-17 12:08:51,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:51,159 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:08:51,266 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:08:51,269 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:08:51,470 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:51,470 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:08:51,531 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 33 treesize of output 17 [2025-03-17 12:08:51,538 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 33 treesize of output 17 [2025-03-17 12:08:51,830 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:51,836 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2025-03-17 12:08:51,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2025-03-17 12:08:51,848 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:08:51,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 16 [2025-03-17 12:08:51,857 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:08:51,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:52,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:52,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1772 treesize of output 1712 [2025-03-17 12:08:52,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:52,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1488 treesize of output 1512 [2025-03-17 12:09:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003840397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:05,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:05,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 34 [2025-03-17 12:09:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296956814] [2025-03-17 12:09:05,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:05,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:09:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:05,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:09:05,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 12:09:05,303 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 34 states, 32 states have (on average 1.625) internal successors, (52), 27 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:06,112 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2025-03-17 12:09:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 12:09:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 27 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-03-17 12:09:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:06,117 INFO L225 Difference]: With dead ends: 169 [2025-03-17 12:09:06,117 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 12:09:06,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 12:09:06,118 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 21 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:06,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1738 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:09:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 12:09:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-03-17 12:09:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 121 states have (on average 1.5206611570247934) internal successors, (184), 147 states have internal predecessors, (184), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2025-03-17 12:09:06,130 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 214 transitions. Word has length 35 [2025-03-17 12:09:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:06,130 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 214 transitions. [2025-03-17 12:09:06,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.625) internal successors, (52), 27 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 214 transitions. [2025-03-17 12:09:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:09:06,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:06,131 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:06,138 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:06,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 12:09:06,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1253295086, now seen corresponding path program 1 times [2025-03-17 12:09:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305200286] [2025-03-17 12:09:06,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:06,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:09:06,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:09:06,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:06,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:06,820 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:06,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:06,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305200286] [2025-03-17 12:09:06,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305200286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:06,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069124958] [2025-03-17 12:09:06,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:06,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:06,823 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:06,825 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:06,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:09:06,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:09:06,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:06,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:06,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:09:06,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:07,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:09:07,108 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 20 treesize of output 8 [2025-03-17 12:09:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:09:07,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:09:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069124958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:09:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 30 [2025-03-17 12:09:07,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098122276] [2025-03-17 12:09:07,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:07,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:09:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:07,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:09:07,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:09:07,147 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:07,358 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2025-03-17 12:09:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:09:07,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-17 12:09:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:07,360 INFO L225 Difference]: With dead ends: 173 [2025-03-17 12:09:07,360 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 12:09:07,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 12:09:07,361 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 34 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:07,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1027 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 12:09:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2025-03-17 12:09:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 122 states have (on average 1.5081967213114753) internal successors, (184), 148 states have internal predecessors, (184), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 214 transitions. [2025-03-17 12:09:07,366 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 214 transitions. Word has length 35 [2025-03-17 12:09:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:07,366 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 214 transitions. [2025-03-17 12:09:07,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 214 transitions. [2025-03-17 12:09:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:09:07,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:07,367 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] [2025-03-17 12:09:07,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:09:07,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:09:07,568 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:07,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1067834041, now seen corresponding path program 1 times [2025-03-17 12:09:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255430365] [2025-03-17 12:09:07,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:07,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:09:07,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:09:07,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:07,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:07,721 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:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255430365] [2025-03-17 12:09:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255430365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804438920] [2025-03-17 12:09:07,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:07,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:07,725 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:07,728 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:07,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:09:07,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:09:07,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:07,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:07,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:09:07,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:07,816 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:07,825 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:07,831 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:07,838 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:07,848 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:09:07,849 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:07,860 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:07,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:07,949 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:07,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804438920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:07,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:07,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-03-17 12:09:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149199303] [2025-03-17 12:09:07,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:07,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 12:09:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:07,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 12:09:07,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:09:07,951 INFO L87 Difference]: Start difference. First operand 168 states and 214 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, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:09:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:08,247 INFO L93 Difference]: Finished difference Result 167 states and 213 transitions. [2025-03-17 12:09:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:09:08,247 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, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2025-03-17 12:09:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:08,248 INFO L225 Difference]: With dead ends: 167 [2025-03-17 12:09:08,248 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 12:09:08,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2025-03-17 12:09:08,249 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 36 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:08,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 571 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 405 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2025-03-17 12:09:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 12:09:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-17 12:09:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 122 states have (on average 1.5) internal successors, (183), 147 states have internal predecessors, (183), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2025-03-17 12:09:08,256 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 38 [2025-03-17 12:09:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:08,256 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2025-03-17 12:09:08,256 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, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:09:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2025-03-17 12:09:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:09:08,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:08,256 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] [2025-03-17 12:09:08,263 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:08,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:08,457 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:08,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1067834040, now seen corresponding path program 1 times [2025-03-17 12:09:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:08,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790131591] [2025-03-17 12:09:08,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:08,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:09:08,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:09:08,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:08,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:08,699 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:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790131591] [2025-03-17 12:09:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790131591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053100732] [2025-03-17 12:09:08,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:08,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:08,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:08,701 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:08,703 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:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:09:08,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:09:08,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:08,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:08,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:09:08,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:08,785 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:08,831 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:08,834 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,854 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:08,907 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:08,919 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:09:08,919 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:08,937 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:08,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:09,155 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:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053100732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:09,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:09,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-17 12:09:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019964384] [2025-03-17 12:09:09,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:09,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 12:09:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:09,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 12:09:09,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=628, Unknown=1, NotChecked=50, Total=756 [2025-03-17 12:09:09,157 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 12:09:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:09,994 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2025-03-17 12:09:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:09:09,994 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 38 [2025-03-17 12:09:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:09,995 INFO L225 Difference]: With dead ends: 165 [2025-03-17 12:09:09,995 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 12:09:09,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=1114, Unknown=1, NotChecked=68, Total=1332 [2025-03-17 12:09:09,996 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 39 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:09,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1155 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 771 Invalid, 0 Unknown, 107 Unchecked, 0.6s Time] [2025-03-17 12:09:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 12:09:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-17 12:09:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.4836065573770492) internal successors, (181), 145 states have internal predecessors, (181), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 211 transitions. [2025-03-17 12:09:10,006 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 211 transitions. Word has length 38 [2025-03-17 12:09:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:10,007 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 211 transitions. [2025-03-17 12:09:10,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 12:09:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 211 transitions. [2025-03-17 12:09:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:09:10,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:10,007 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] [2025-03-17 12:09:10,015 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:10,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:10,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:10,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1163494100, now seen corresponding path program 1 times [2025-03-17 12:09:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411880409] [2025-03-17 12:09:10,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:10,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:09:10,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:09:10,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:10,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411880409] [2025-03-17 12:09:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411880409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788244943] [2025-03-17 12:09:10,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:10,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:10,638 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:10,639 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:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:09:10,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:09:10,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:10,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-17 12:09:10,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:10,717 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:10,744 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:10,747 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:10,751 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:10,757 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:10,883 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:10,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:10,926 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:10,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:10,935 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:10,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:10,941 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:10,986 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-17 12:09:10,986 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:11,014 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-17 12:09:11,014 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:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:11,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788244943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:11,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2025-03-17 12:09:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612441215] [2025-03-17 12:09:11,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:11,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 12:09:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:11,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 12:09:11,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=673, Unknown=1, NotChecked=52, Total=812 [2025-03-17 12:09:11,448 INFO L87 Difference]: Start difference. First operand 165 states and 211 transitions. Second operand has 25 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:11,980 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2025-03-17 12:09:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:09:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2025-03-17 12:09:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:11,981 INFO L225 Difference]: With dead ends: 169 [2025-03-17 12:09:11,981 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 12:09:11,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=1124, Unknown=1, NotChecked=68, Total=1332 [2025-03-17 12:09:11,982 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 11 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:11,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 992 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 600 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2025-03-17 12:09:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 12:09:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2025-03-17 12:09:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.472) internal successors, (184), 148 states have internal predecessors, (184), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 214 transitions. [2025-03-17 12:09:11,986 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 214 transitions. Word has length 38 [2025-03-17 12:09:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:11,986 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 214 transitions. [2025-03-17 12:09:11,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 214 transitions. [2025-03-17 12:09:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:09:11,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:11,987 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:11,993 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:12,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:12,188 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:12,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1708563919, now seen corresponding path program 1 times [2025-03-17 12:09:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:12,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111732867] [2025-03-17 12:09:12,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:12,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 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 39 of 39 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,233 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:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111732867] [2025-03-17 12:09:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111732867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:12,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:12,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:09:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253193468] [2025-03-17 12:09:12,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:12,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:09:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:12,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:09:12,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:09:12,235 INFO L87 Difference]: Start difference. First operand 168 states and 214 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:12,343 INFO L93 Difference]: Finished difference Result 201 states and 251 transitions. [2025-03-17 12:09:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:09:12,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-17 12:09:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:12,344 INFO L225 Difference]: With dead ends: 201 [2025-03-17 12:09:12,344 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 12:09:12,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:09:12,345 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 41 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:12,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 279 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:09:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 12:09:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 181. [2025-03-17 12:09:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 139 states have (on average 1.5035971223021583) internal successors, (209), 161 states have internal predecessors, (209), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 239 transitions. [2025-03-17 12:09:12,349 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 239 transitions. Word has length 39 [2025-03-17 12:09:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:12,349 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 239 transitions. [2025-03-17 12:09:12,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2025-03-17 12:09:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:09:12,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:12,349 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:12,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:09:12,350 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1708563920, now seen corresponding path program 1 times [2025-03-17 12:09:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399348155] [2025-03-17 12:09:12,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:12,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:09:12,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:09:12,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:12,458 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:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399348155] [2025-03-17 12:09:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399348155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617215697] [2025-03-17 12:09:12,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:12,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:12,461 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:12,462 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:12,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:09:12,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:09:12,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:12,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:12,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 12:09:12,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:12,553 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,557 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,644 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,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:12,674 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,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:09:12,679 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,756 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:12,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617215697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:12,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:09:12,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2025-03-17 12:09:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100458693] [2025-03-17 12:09:12,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:12,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:09:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:12,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:09:12,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=408, Unknown=1, NotChecked=40, Total=506 [2025-03-17 12:09:12,942 INFO L87 Difference]: Start difference. First operand 181 states and 239 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:13,260 INFO L93 Difference]: Finished difference Result 216 states and 282 transitions. [2025-03-17 12:09:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:09:13,261 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2025-03-17 12:09:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:13,261 INFO L225 Difference]: With dead ends: 216 [2025-03-17 12:09:13,261 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 12:09:13,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=623, Unknown=1, NotChecked=50, Total=756 [2025-03-17 12:09:13,263 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 53 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:13,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 726 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 562 Invalid, 0 Unknown, 321 Unchecked, 0.2s Time] [2025-03-17 12:09:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 12:09:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2025-03-17 12:09:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 160 states have (on average 1.51875) internal successors, (243), 182 states have internal predecessors, (243), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 273 transitions. [2025-03-17 12:09:13,267 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 273 transitions. Word has length 39 [2025-03-17 12:09:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:13,267 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 273 transitions. [2025-03-17 12:09:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:09:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 273 transitions. [2025-03-17 12:09:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:09:13,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:13,268 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:13,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:09:13,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 12:09:13,472 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 36 more)] === [2025-03-17 12:09:13,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1708563056, now seen corresponding path program 1 times [2025-03-17 12:09:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116043136] [2025-03-17 12:09:13,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:13,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:09:13,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:09:13,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:13,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:13,526 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:13,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116043136] [2025-03-17 12:09:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116043136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:13,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:09:13,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149705582] [2025-03-17 12:09:13,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:13,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:09:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:13,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:09:13,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:09:13,528 INFO L87 Difference]: Start difference. First operand 202 states and 273 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:13,572 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2025-03-17 12:09:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:09:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-17 12:09:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:13,574 INFO L225 Difference]: With dead ends: 211 [2025-03-17 12:09:13,574 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 12:09:13,574 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:13,575 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 41 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:13,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 547 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:09:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 12:09:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 202. [2025-03-17 12:09:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 160 states have (on average 1.50625) internal successors, (241), 182 states have internal predecessors, (241), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 271 transitions. [2025-03-17 12:09:13,579 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 271 transitions. Word has length 39 [2025-03-17 12:09:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:13,580 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 271 transitions. [2025-03-17 12:09:13,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 271 transitions. [2025-03-17 12:09:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:09:13,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:13,580 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] [2025-03-17 12:09:13,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:09:13,581 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:13,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1653012575, now seen corresponding path program 1 times [2025-03-17 12:09:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877041385] [2025-03-17 12:09:13,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:13,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:09:13,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:09:13,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:13,905 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:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877041385] [2025-03-17 12:09:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877041385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109542653] [2025-03-17 12:09:13,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:13,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:13,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:13,907 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:13,909 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:13,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:09:13,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:09:13,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:13,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:13,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-17 12:09:13,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:14,132 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 19 treesize of output 1 [2025-03-17 12:09:14,136 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 19 treesize of output 1 [2025-03-17 12:09:14,186 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 29 treesize of output 17 [2025-03-17 12:09:14,188 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 32 treesize of output 14 [2025-03-17 12:09:14,226 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:14,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:14,252 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 30 treesize of output 24 [2025-03-17 12:09:14,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:14,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:14,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:14,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:09:14,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:14,337 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:14,414 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:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109542653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:14,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:14,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 29 [2025-03-17 12:09:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984637335] [2025-03-17 12:09:14,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:14,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 12:09:14,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:14,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 12:09:14,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:09:14,415 INFO L87 Difference]: Start difference. First operand 202 states and 271 transitions. Second operand has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 5 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:09:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:14,767 INFO L93 Difference]: Finished difference Result 218 states and 289 transitions. [2025-03-17 12:09:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:09:14,768 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 5 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 44 [2025-03-17 12:09:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:14,768 INFO L225 Difference]: With dead ends: 218 [2025-03-17 12:09:14,768 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 12:09:14,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 12:09:14,769 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:14,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1630 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:09:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 12:09:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2025-03-17 12:09:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.4939759036144578) internal successors, (248), 188 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 278 transitions. [2025-03-17 12:09:14,774 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 278 transitions. Word has length 44 [2025-03-17 12:09:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:14,774 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 278 transitions. [2025-03-17 12:09:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 5 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:09:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 278 transitions. [2025-03-17 12:09:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:09:14,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:14,775 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] [2025-03-17 12:09:14,782 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:14,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 12:09:14,975 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:14,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1653012574, now seen corresponding path program 1 times [2025-03-17 12:09:14,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:14,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794275850] [2025-03-17 12:09:14,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:14,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:09:14,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:09:14,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:14,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:09:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794275850] [2025-03-17 12:09:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794275850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045500688] [2025-03-17 12:09:15,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:15,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:15,200 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:15,201 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:15,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:09:15,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:09:15,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:15,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:15,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 12:09:15,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:15,340 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 19 treesize of output 1 [2025-03-17 12:09:15,371 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 21 treesize of output 9 [2025-03-17 12:09:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:09:15,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:09:15,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-17 12:09:15,446 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:09:15,446 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 12 treesize of output 11 [2025-03-17 12:09:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:09:15,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045500688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:09:15,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:09:15,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 19 [2025-03-17 12:09:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716114886] [2025-03-17 12:09:15,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:09:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:09:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:15,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:09:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:09:15,460 INFO L87 Difference]: Start difference. First operand 208 states and 278 transitions. Second operand has 20 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 12:09:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:15,793 INFO L93 Difference]: Finished difference Result 218 states and 288 transitions. [2025-03-17 12:09:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:09:15,793 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2025-03-17 12:09:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:15,794 INFO L225 Difference]: With dead ends: 218 [2025-03-17 12:09:15,794 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 12:09:15,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-17 12:09:15,795 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 26 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:15,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1274 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:09:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 12:09:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2025-03-17 12:09:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.4879518072289157) internal successors, (247), 188 states have internal predecessors, (247), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 277 transitions. [2025-03-17 12:09:15,799 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 277 transitions. Word has length 44 [2025-03-17 12:09:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:15,799 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 277 transitions. [2025-03-17 12:09:15,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 12:09:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 277 transitions. [2025-03-17 12:09:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:09:15,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:15,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 12:09:15,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 12:09:16,000 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,SelfDestructingSolverStorable24 [2025-03-17 12:09:16,000 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:16,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1400727240, now seen corresponding path program 1 times [2025-03-17 12:09:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:16,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827203338] [2025-03-17 12:09:16,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:16,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:09:16,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:09:16,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:16,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827203338] [2025-03-17 12:09:16,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827203338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:16,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:16,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:09:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640389498] [2025-03-17 12:09:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:16,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:09:16,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:16,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:09:16,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:09:16,138 INFO L87 Difference]: Start difference. First operand 208 states and 277 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:09:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:16,335 INFO L93 Difference]: Finished difference Result 208 states and 274 transitions. [2025-03-17 12:09:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2025-03-17 12:09:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:16,336 INFO L225 Difference]: With dead ends: 208 [2025-03-17 12:09:16,337 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 12:09:16,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:09:16,337 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:16,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 489 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 12:09:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-17 12:09:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.4698795180722892) internal successors, (244), 188 states have internal predecessors, (244), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 274 transitions. [2025-03-17 12:09:16,341 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 274 transitions. Word has length 50 [2025-03-17 12:09:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:16,341 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 274 transitions. [2025-03-17 12:09:16,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:09:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 274 transitions. [2025-03-17 12:09:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:09:16,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:16,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 12:09:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 12:09:16,342 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:16,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1400727241, now seen corresponding path program 1 times [2025-03-17 12:09:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158868607] [2025-03-17 12:09:16,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:16,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:09:16,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:09:16,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:16,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:09:16,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:16,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158868607] [2025-03-17 12:09:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158868607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:16,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 12:09:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300539166] [2025-03-17 12:09:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:16,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:09:16,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:16,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:09:16,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:09:16,557 INFO L87 Difference]: Start difference. First operand 208 states and 274 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:09:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:16,824 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2025-03-17 12:09:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:09:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2025-03-17 12:09:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:16,825 INFO L225 Difference]: With dead ends: 208 [2025-03-17 12:09:16,825 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 12:09:16,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:09:16,826 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:16,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 516 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 12:09:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-17 12:09:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.4518072289156627) internal successors, (241), 188 states have internal predecessors, (241), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 271 transitions. [2025-03-17 12:09:16,833 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 271 transitions. Word has length 50 [2025-03-17 12:09:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:16,833 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 271 transitions. [2025-03-17 12:09:16,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:09:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2025-03-17 12:09:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:09:16,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:16,833 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, 1, 1] [2025-03-17 12:09:16,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:09:16,833 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash 439844305, now seen corresponding path program 1 times [2025-03-17 12:09:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909112124] [2025-03-17 12:09:16,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:09:16,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:09:16,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:16,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:17,091 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:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909112124] [2025-03-17 12:09:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909112124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:17,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 12:09:17,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805133073] [2025-03-17 12:09:17,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:17,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:09:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:17,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:09:17,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:09:17,093 INFO L87 Difference]: Start difference. First operand 208 states and 271 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:17,360 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2025-03-17 12:09:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:09:17,364 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-17 12:09:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:17,364 INFO L225 Difference]: With dead ends: 225 [2025-03-17 12:09:17,364 INFO L226 Difference]: Without dead ends: 225 [2025-03-17 12:09:17,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:09:17,365 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 39 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:17,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 709 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-17 12:09:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2025-03-17 12:09:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 173 states have (on average 1.4335260115606936) internal successors, (248), 194 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 278 transitions. [2025-03-17 12:09:17,370 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 278 transitions. Word has length 44 [2025-03-17 12:09:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:17,370 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 278 transitions. [2025-03-17 12:09:17,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 278 transitions. [2025-03-17 12:09:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:09:17,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:17,372 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, 1, 1] [2025-03-17 12:09:17,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 12:09:17,372 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash 439844306, now seen corresponding path program 1 times [2025-03-17 12:09:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404733120] [2025-03-17 12:09:17,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:09:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:17,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:09:17,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:09:17,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:09:17,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:17,678 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:17,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:17,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404733120] [2025-03-17 12:09:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404733120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:09:17,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:09:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 12:09:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808080108] [2025-03-17 12:09:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:09:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:09:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:09:17,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:09:17,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:09:17,680 INFO L87 Difference]: Start difference. First operand 214 states and 278 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:09:17,966 INFO L93 Difference]: Finished difference Result 231 states and 294 transitions. [2025-03-17 12:09:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:09:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-17 12:09:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:09:17,967 INFO L225 Difference]: With dead ends: 231 [2025-03-17 12:09:17,967 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 12:09:17,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:09:17,968 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:09:17,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 774 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:09:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 12:09:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 216. [2025-03-17 12:09:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 196 states have internal predecessors, (249), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-17 12:09:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2025-03-17 12:09:17,974 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 44 [2025-03-17 12:09:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:09:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2025-03-17 12:09:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:09:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2025-03-17 12:09:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:09:17,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:09:17,975 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-17 12:09:17,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 12:09:17,975 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-17 12:09:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:09:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1344052089, now seen corresponding path program 2 times [2025-03-17 12:09:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:09:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666075002] [2025-03-17 12:09:17,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:09:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:09:17,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-17 12:09:17,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:09:17,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:09:17,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 12:09:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:09:18,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666075002] [2025-03-17 12:09:18,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666075002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:09:18,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426652739] [2025-03-17 12:09:18,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:09:18,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:09:18,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:09:18,807 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:18,808 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:18,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-17 12:09:18,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:09:18,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:09:18,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:09:18,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 12:09:18,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:09:18,912 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,915 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:18,941 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))) (= (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:19,064 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,114 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 108 treesize of output 64 [2025-03-17 12:09:19,172 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (= |c_#length| (store |c_old(#length)| create_internal_~now~0.base (select |c_#length| create_internal_~now~0.base))) (= |c_#valid| (store |c_old(#valid)| create_internal_~now~0.base (select |c_#valid| create_internal_~now~0.base))))) (exists ((create_internal_~now~0.base Int)) (and (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base)) create_internal_~now~0.base (select |c_#valid| create_internal_~now~0.base))) (= (store (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) create_internal_~now~0.base (select |c_#length| create_internal_~now~0.base)) |c_#length|)))))) is different from true [2025-03-17 12:09:19,204 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:20,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:20,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 298 treesize of output 894 [2025-03-17 12:09:21,553 INFO L349 Elim1Store]: treesize reduction 346, result has 12.2 percent of original size [2025-03-17 12:09:21,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 177 treesize of output 549