./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-data.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-middle-data.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 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:08:26,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:08:26,263 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:26,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:08:26,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:08:26,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:08:26,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:08:26,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:08:26,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:08:26,286 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:08:26,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:08:26,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:08:26,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:08:26,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:08:26,286 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:08:26,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:08:26,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:08:26,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:26,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:08:26,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:08:26,288 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 -> 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e [2025-03-17 12:08:26,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:08:26,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:08:26,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:08:26,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:08:26,574 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:08:26,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2025-03-17 12:08:27,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a701efc/6d6627e54e554ee0a37cc1aea633fbce/FLAG4321b9f21 [2025-03-17 12:08:28,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:08:28,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2025-03-17 12:08:28,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a701efc/6d6627e54e554ee0a37cc1aea633fbce/FLAG4321b9f21 [2025-03-17 12:08:28,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a701efc/6d6627e54e554ee0a37cc1aea633fbce [2025-03-17 12:08:28,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:08:28,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:08:28,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:28,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:08:28,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:08:28,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:28" (1/1) ... [2025-03-17 12:08:28,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbc53c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:28, skipping insertion in model container [2025-03-17 12:08:28,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:28" (1/1) ... [2025-03-17 12:08:28,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:08:28,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:28,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:08:28,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:08:28,365 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:08:28,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:28 WrapperNode [2025-03-17 12:08:28,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:08:28,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:28,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:08:28,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:08:28,371 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:28" (1/1) ... [2025-03-17 12:08:28,379 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:28" (1/1) ... [2025-03-17 12:08:28,394 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2025-03-17 12:08:28,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:08:28,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:08:28,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:08:28,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:08:28,401 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:28" (1/1) ... [2025-03-17 12:08:28,401 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:28" (1/1) ... [2025-03-17 12:08:28,404 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:28" (1/1) ... [2025-03-17 12:08:28,421 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2025-03-17 12:08:28,421 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:28" (1/1) ... [2025-03-17 12:08:28,422 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:28" (1/1) ... [2025-03-17 12:08:28,425 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:28" (1/1) ... [2025-03-17 12:08:28,426 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:28" (1/1) ... [2025-03-17 12:08:28,428 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:28" (1/1) ... [2025-03-17 12:08:28,428 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:28" (1/1) ... [2025-03-17 12:08:28,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:08:28,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:08:28,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:08:28,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:08:28,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:28" (1/1) ... [2025-03-17 12:08:28,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:08:28,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:28,461 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:28,468 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:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:08:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-17 12:08:28,483 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-17 12:08:28,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:08:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:08:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:08:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:08:28,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:08:28,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:08:28,558 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:08:28,559 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:08:28,731 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-03-17 12:08:28,732 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:08:28,740 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:08:28,740 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:08:28,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:28 BoogieIcfgContainer [2025-03-17 12:08:28,740 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:08:28,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:08:28,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:08:28,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:08:28,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:08:28" (1/3) ... [2025-03-17 12:08:28,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0341de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:28, skipping insertion in model container [2025-03-17 12:08:28,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:28" (2/3) ... [2025-03-17 12:08:28,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0341de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:28, skipping insertion in model container [2025-03-17 12:08:28,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:28" (3/3) ... [2025-03-17 12:08:28,748 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-middle-data.i [2025-03-17 12:08:28,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:08:28,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-middle-data.i that has 2 procedures, 66 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-03-17 12:08:28,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:08:28,803 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;@72c556a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:08:28,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 12:08:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:28,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:28,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:28,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:28,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2957123, now seen corresponding path program 1 times [2025-03-17 12:08:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747474427] [2025-03-17 12:08:28,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:28,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:28,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:28,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:28,999 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:29,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747474427] [2025-03-17 12:08:29,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747474427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:29,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:29,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:29,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359793904] [2025-03-17 12:08:29,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:29,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:29,026 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:29,091 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2025-03-17 12:08:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:29,093 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:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:29,096 INFO L225 Difference]: With dead ends: 65 [2025-03-17 12:08:29,097 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 12:08:29,098 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:29,101 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:29,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 12:08:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 12:08:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2025-03-17 12:08:29,130 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 4 [2025-03-17 12:08:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:29,130 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2025-03-17 12:08:29,131 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:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2025-03-17 12:08:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:08:29,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:29,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:08:29,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:08:29,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2957124, now seen corresponding path program 1 times [2025-03-17 12:08:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137966629] [2025-03-17 12:08:29,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:29,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:08:29,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:08:29,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:29,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,215 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:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137966629] [2025-03-17 12:08:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137966629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:08:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172443831] [2025-03-17 12:08:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:08:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:08:29,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:08:29,219 INFO L87 Difference]: Start difference. First operand 63 states and 66 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:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:29,276 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-03-17 12:08:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:08:29,277 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:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:29,277 INFO L225 Difference]: With dead ends: 62 [2025-03-17 12:08:29,277 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 12:08:29,277 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:29,278 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:29,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 12:08:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 12:08:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-17 12:08:29,282 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 4 [2025-03-17 12:08:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:29,282 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-17 12:08:29,282 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:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-17 12:08:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:08:29,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:29,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:29,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:08:29,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:29,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1792111198, now seen corresponding path program 1 times [2025-03-17 12:08:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925735512] [2025-03-17 12:08:29,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:29,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:08:29,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:08:29,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:29,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,366 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:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925735512] [2025-03-17 12:08:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925735512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:08:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183112087] [2025-03-17 12:08:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:29,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:29,368 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:29,469 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-03-17 12:08:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-03-17 12:08:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:29,471 INFO L225 Difference]: With dead ends: 61 [2025-03-17 12:08:29,471 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 12:08:29,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:29,471 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 145 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:29,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 145 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:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 12:08:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-03-17 12:08:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.6) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-17 12:08:29,476 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 9 [2025-03-17 12:08:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:29,477 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-17 12:08:29,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-17 12:08:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:08:29,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:29,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:29,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:08:29,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1792111199, now seen corresponding path program 1 times [2025-03-17 12:08:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914298815] [2025-03-17 12:08:29,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:29,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:08:29,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:08:29,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:29,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,658 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:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914298815] [2025-03-17 12:08:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914298815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:29,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:08:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314486864] [2025-03-17 12:08:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:29,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:29,659 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:29,738 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-03-17 12:08:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:29,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-03-17 12:08:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:29,739 INFO L225 Difference]: With dead ends: 59 [2025-03-17 12:08:29,739 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 12:08:29,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:29,740 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:29,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 176 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 12:08:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-17 12:08:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.542857142857143) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-03-17 12:08:29,746 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 9 [2025-03-17 12:08:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:29,747 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-03-17 12:08:29,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-03-17 12:08:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:08:29,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:29,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:29,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:08:29,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:29,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:29,749 INFO L85 PathProgramCache]: Analyzing trace with hash -490320005, now seen corresponding path program 1 times [2025-03-17 12:08:29,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385303337] [2025-03-17 12:08:29,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:29,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:08:29,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:08:29,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:29,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:29,870 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:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385303337] [2025-03-17 12:08:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385303337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:29,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680297733] [2025-03-17 12:08:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:29,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:29,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:29,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:29,873 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:29,968 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-03-17 12:08:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 12:08:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:29,969 INFO L225 Difference]: With dead ends: 61 [2025-03-17 12:08:29,969 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 12:08:29,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:29,970 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:29,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 12:08:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-17 12:08:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-17 12:08:29,980 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 17 [2025-03-17 12:08:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:29,980 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-17 12:08:29,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-17 12:08:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:08:29,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:29,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:29,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:08:29,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:29,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash -490320004, now seen corresponding path program 1 times [2025-03-17 12:08:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714702575] [2025-03-17 12:08:29,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:30,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:08:30,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:08:30,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,192 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:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714702575] [2025-03-17 12:08:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714702575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:30,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:30,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074009969] [2025-03-17 12:08:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:30,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:30,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:30,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:30,194 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:30,298 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-17 12:08:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 12:08:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:30,299 INFO L225 Difference]: With dead ends: 61 [2025-03-17 12:08:30,299 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 12:08:30,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:30,299 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:30,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 192 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 12:08:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-17 12:08:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.525) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-03-17 12:08:30,307 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 17 [2025-03-17 12:08:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:30,307 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-03-17 12:08:30,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-03-17 12:08:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:08:30,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:30,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:30,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:08:30,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1979944117, now seen corresponding path program 1 times [2025-03-17 12:08:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213409814] [2025-03-17 12:08:30,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:30,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:08:30,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:08:30,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,376 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:30,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:30,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213409814] [2025-03-17 12:08:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213409814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:30,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019321548] [2025-03-17 12:08:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:30,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:30,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:30,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:30,378 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:30,409 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2025-03-17 12:08:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-17 12:08:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:30,412 INFO L225 Difference]: With dead ends: 62 [2025-03-17 12:08:30,412 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 12:08:30,412 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:30,412 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:30,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 274 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 12:08:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-17 12:08:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2025-03-17 12:08:30,415 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 18 [2025-03-17 12:08:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:30,415 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2025-03-17 12:08:30,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2025-03-17 12:08:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:08:30,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:30,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:30,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:08:30,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:30,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1868237066, now seen corresponding path program 1 times [2025-03-17 12:08:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:30,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577104962] [2025-03-17 12:08:30,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:30,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:30,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:30,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577104962] [2025-03-17 12:08:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577104962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541770502] [2025-03-17 12:08:30,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:30,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:30,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:30,627 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:30,628 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:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:30,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:30,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:30,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:30,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 12:08:30,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:30,754 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-03-17 12:08:30,821 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:08:30,821 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:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:30,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:08:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541770502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:08:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-03-17 12:08:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042360081] [2025-03-17 12:08:30,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:30,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:08:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:30,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:08:30,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:08:30,827 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:30,869 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-03-17 12:08:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:08:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-03-17 12:08:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:30,871 INFO L225 Difference]: With dead ends: 63 [2025-03-17 12:08:30,872 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 12:08:30,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:08:30,872 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:30,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 86 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 75 Unchecked, 0.0s Time] [2025-03-17 12:08:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 12:08:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 12:08:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.5) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-03-17 12:08:30,878 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 21 [2025-03-17 12:08:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:30,879 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-03-17 12:08:30,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2025-03-17 12:08:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:08:30,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:30,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:30,887 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:31,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:31,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:31,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1868237065, now seen corresponding path program 1 times [2025-03-17 12:08:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:31,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054239445] [2025-03-17 12:08:31,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:31,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:31,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:31,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,323 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:31,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:31,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054239445] [2025-03-17 12:08:31,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054239445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:31,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269079658] [2025-03-17 12:08:31,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:31,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:31,326 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:31,327 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:31,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:31,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:31,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:31,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 12:08:31,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:31,480 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-03-17 12:08:31,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:31,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:08:31,518 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:31,518 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:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:31,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:08:31,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269079658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:31,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:08:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-03-17 12:08:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379067377] [2025-03-17 12:08:31,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:31,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:31,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:31,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:31,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:08:31,537 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:31,625 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-03-17 12:08:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-03-17 12:08:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:31,626 INFO L225 Difference]: With dead ends: 77 [2025-03-17 12:08:31,626 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 12:08:31,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:08:31,627 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:31,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2025-03-17 12:08:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 12:08:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-03-17 12:08:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 68 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-03-17 12:08:31,634 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 21 [2025-03-17 12:08:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:31,636 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-03-17 12:08:31,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2025-03-17 12:08:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:08:31,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:31,637 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:31,644 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:31,841 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,SelfDestructingSolverStorable8 [2025-03-17 12:08:31,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:31,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash 60495929, now seen corresponding path program 1 times [2025-03-17 12:08:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:31,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659979398] [2025-03-17 12:08:31,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:31,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:31,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:08:31,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:08:31,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:31,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:32,276 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:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659979398] [2025-03-17 12:08:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659979398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840192786] [2025-03-17 12:08:32,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:32,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:32,280 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:32,281 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:32,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:08:32,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:08:32,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:32,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:32,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-17 12:08:32,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:32,364 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:32,370 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:32,431 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 11 [2025-03-17 12:08:32,440 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 11 [2025-03-17 12:08:32,471 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 11 [2025-03-17 12:08:32,476 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 11 [2025-03-17 12:08:32,526 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:32,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:32,810 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:32,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840192786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:32,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-17 12:08:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827030066] [2025-03-17 12:08:32,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:32,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:08:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:32,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:08:32,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:08:32,811 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:32,922 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-03-17 12:08:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:32,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-17 12:08:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:32,923 INFO L225 Difference]: With dead ends: 75 [2025-03-17 12:08:32,923 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 12:08:32,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:08:32,924 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:32,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 444 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 12:08:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 12:08:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-17 12:08:32,929 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 20 [2025-03-17 12:08:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:32,929 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-17 12:08:32,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-17 12:08:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:08:32,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:32,930 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] [2025-03-17 12:08:32,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:08:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:33,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1875368887, now seen corresponding path program 1 times [2025-03-17 12:08:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-03-17 12:08:33,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:33,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:33,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:33,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:33,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:33,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-03-17 12:08:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655331817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:33,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:33,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776252492] [2025-03-17 12:08:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:33,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:33,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:33,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:33,234 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:33,327 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-03-17 12:08:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 12:08:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:33,328 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:08:33,328 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:08:33,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:33,329 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:33,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:08:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 12:08:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 71 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-03-17 12:08:33,331 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 21 [2025-03-17 12:08:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:33,332 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-03-17 12:08:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-03-17 12:08:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:08:33,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:33,332 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] [2025-03-17 12:08:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:08:33,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1875368888, now seen corresponding path program 1 times [2025-03-17 12:08:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-17 12:08:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:33,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:33,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:33,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-17 12:08:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867817005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:33,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:33,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068073385] [2025-03-17 12:08:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:33,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:33,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:33,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:33,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:33,463 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:33,561 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-03-17 12:08:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 12:08:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:33,564 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:08:33,564 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:08:33,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:33,565 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:33,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 196 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:08:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 12:08:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-03-17 12:08:33,567 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 21 [2025-03-17 12:08:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:33,567 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-03-17 12:08:33,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-03-17 12:08:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:08:33,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:33,570 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] [2025-03-17 12:08:33,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:08:33,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:33,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1875368536, now seen corresponding path program 1 times [2025-03-17 12:08:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:33,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596563467] [2025-03-17 12:08:33,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:33,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:08:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:08:33,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:33,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596563467] [2025-03-17 12:08:33,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596563467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:33,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:33,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:08:33,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171938097] [2025-03-17 12:08:33,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:33,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:33,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:33,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:33,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:33,638 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:33,680 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2025-03-17 12:08:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:33,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 12:08:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:33,681 INFO L225 Difference]: With dead ends: 85 [2025-03-17 12:08:33,681 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 12:08:33,681 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:08:33,681 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:33,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 292 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 12:08:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2025-03-17 12:08:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 74 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2025-03-17 12:08:33,684 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 21 [2025-03-17 12:08:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:33,684 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2025-03-17 12:08:33,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2025-03-17 12:08:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:08:33,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:33,685 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] [2025-03-17 12:08:33,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:08:33,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:33,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 919370864, now seen corresponding path program 1 times [2025-03-17 12:08:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:33,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-03-17 12:08:33,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:33,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:08:33,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:08:33,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:08:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-03-17 12:08:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83329312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:33,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:33,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979419690] [2025-03-17 12:08:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:33,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:33,764 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:33,837 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-03-17 12:08:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:33,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-17 12:08:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:33,838 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:08:33,838 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:08:33,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:33,839 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:33,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:08:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 12:08:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 73 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2025-03-17 12:08:33,842 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 25 [2025-03-17 12:08:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:33,842 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2025-03-17 12:08:33,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2025-03-17 12:08:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:08:33,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:33,843 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] [2025-03-17 12:08:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:08:33,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:33,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:33,843 INFO L85 PathProgramCache]: Analyzing trace with hash 919370865, now seen corresponding path program 1 times [2025-03-17 12:08:33,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:33,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857519212] [2025-03-17 12:08:33,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:33,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:08:33,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:08:33,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:33,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:33,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:33,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857519212] [2025-03-17 12:08:33,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857519212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:33,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:33,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:08:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878144523] [2025-03-17 12:08:33,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:33,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:33,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:33,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:33,997 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:34,075 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-03-17 12:08:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-17 12:08:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:34,076 INFO L225 Difference]: With dead ends: 77 [2025-03-17 12:08:34,076 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 12:08:34,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:34,076 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:34,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 12:08:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 12:08:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-17 12:08:34,079 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 25 [2025-03-17 12:08:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:34,079 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-17 12:08:34,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:08:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-17 12:08:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:08:34,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:34,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:08:34,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 179911288, now seen corresponding path program 1 times [2025-03-17 12:08:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739360162] [2025-03-17 12:08:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:34,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:08:34,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:08:34,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:34,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:08:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:34,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739360162] [2025-03-17 12:08:34,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739360162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:34,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:08:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:08:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627408930] [2025-03-17 12:08:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:08:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:34,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:08:34,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:34,157 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:34,211 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-03-17 12:08:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:08:34,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 12:08:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:34,212 INFO L225 Difference]: With dead ends: 82 [2025-03-17 12:08:34,212 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 12:08:34,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:08:34,213 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:34,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 256 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 12:08:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-17 12:08:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 76 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-03-17 12:08:34,215 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 24 [2025-03-17 12:08:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:34,215 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-03-17 12:08:34,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2025-03-17 12:08:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:08:34,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:34,216 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] [2025-03-17 12:08:34,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:08:34,216 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:34,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash -382025136, now seen corresponding path program 1 times [2025-03-17 12:08:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:34,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990477056] [2025-03-17 12:08:34,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:34,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:08:34,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:08:34,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:34,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:34,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:34,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990477056] [2025-03-17 12:08:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990477056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:34,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282811387] [2025-03-17 12:08:34,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:34,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:34,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:34,599 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:34,601 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:34,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:08:34,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:08:34,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:34,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:34,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 12:08:34,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:34,697 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:34,704 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:34,798 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 11 [2025-03-17 12:08:34,805 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 11 [2025-03-17 12:08:34,823 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 11 [2025-03-17 12:08:34,828 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 11 [2025-03-17 12:08:34,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:34,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-17 12:08:34,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:34,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-17 12:08:34,986 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:08:34,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:35,363 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 18 [2025-03-17 12:08:35,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 214 [2025-03-17 12:08:35,375 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:08:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282811387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:35,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 30 [2025-03-17 12:08:35,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979329282] [2025-03-17 12:08:35,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:35,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 12:08:35,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:35,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 12:08:35,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:08:35,379 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:08:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:35,778 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2025-03-17 12:08:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:08:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-17 12:08:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:35,779 INFO L225 Difference]: With dead ends: 84 [2025-03-17 12:08:35,779 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 12:08:35,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 12:08:35,780 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:35,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 664 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:08:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 12:08:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 12:08:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2025-03-17 12:08:35,784 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 27 [2025-03-17 12:08:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:35,785 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2025-03-17 12:08:35,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:08:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2025-03-17 12:08:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:08:35,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:35,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:35,793 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:35,990 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,SelfDestructingSolverStorable16 [2025-03-17 12:08:35,991 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:35,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash -382025487, now seen corresponding path program 1 times [2025-03-17 12:08:35,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:35,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065454808] [2025-03-17 12:08:35,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:36,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:08:36,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:08:36,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:36,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:36,112 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:08:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:36,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065454808] [2025-03-17 12:08:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065454808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:36,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371942159] [2025-03-17 12:08:36,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:36,115 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:36,116 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:36,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:08:36,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:08:36,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:36,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:36,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 12:08:36,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:36,240 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 13 treesize of output 9 [2025-03-17 12:08:36,259 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:08:36,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:36,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-03-17 12:08:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371942159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:36,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2025-03-17 12:08:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829467553] [2025-03-17 12:08:36,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:36,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:08:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:36,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:08:36,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:08:36,305 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:36,417 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-03-17 12:08:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:36,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-17 12:08:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:36,418 INFO L225 Difference]: With dead ends: 85 [2025-03-17 12:08:36,418 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:08:36,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=91, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:08:36,418 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:36,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:08:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 12:08:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 67 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2025-03-17 12:08:36,421 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 27 [2025-03-17 12:08:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2025-03-17 12:08:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:08:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2025-03-17 12:08:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:08:36,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:36,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:36,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:36,624 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,SelfDestructingSolverStorable17 [2025-03-17 12:08:36,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:36,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -899878166, now seen corresponding path program 1 times [2025-03-17 12:08:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433888734] [2025-03-17 12:08:36,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:36,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:08:36,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:08:36,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:36,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:36,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:36,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433888734] [2025-03-17 12:08:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433888734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:36,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000587840] [2025-03-17 12:08:36,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:36,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:36,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:36,838 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:08:36,839 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:08:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:08:36,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:08:36,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:36,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:36,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 12:08:36,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:36,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:36,950 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:36,964 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:08:37,007 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:08:37,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 12:08:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:37,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:08:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000587840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:08:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 19 [2025-03-17 12:08:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956457958] [2025-03-17 12:08:37,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:37,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:08:37,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:37,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:08:37,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:08:37,020 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:37,165 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2025-03-17 12:08:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:08:37,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-17 12:08:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:37,166 INFO L225 Difference]: With dead ends: 73 [2025-03-17 12:08:37,166 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 12:08:37,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:08:37,167 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 26 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:37,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 278 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 12:08:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-17 12:08:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 67 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2025-03-17 12:08:37,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 29 [2025-03-17 12:08:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:37,171 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2025-03-17 12:08:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2025-03-17 12:08:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:08:37,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:37,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:37,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:37,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:37,372 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:37,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash -899878165, now seen corresponding path program 1 times [2025-03-17 12:08:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:37,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592065347] [2025-03-17 12:08:37,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:37,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:08:37,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:08:37,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:37,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:37,672 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:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592065347] [2025-03-17 12:08:37,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592065347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831346218] [2025-03-17 12:08:37,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:37,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:37,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:37,674 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:08:37,676 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:08:37,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:08:37,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:08:37,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:37,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:37,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:08:37,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:37,781 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:37,829 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:37,830 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:37,852 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:08:37,854 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 13 treesize of output 9 [2025-03-17 12:08:37,920 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:37,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:08:37,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 30 treesize of output 13 [2025-03-17 12:08:37,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 12:08:37,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:08:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:37,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:08:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831346218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:08:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:08:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2025-03-17 12:08:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361129710] [2025-03-17 12:08:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:08:37,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:08:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:37,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:08:37,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:08:37,960 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:38,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:38,126 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-03-17 12:08:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:08:38,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-17 12:08:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:38,127 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:08:38,127 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:08:38,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-17 12:08:38,128 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:38,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 254 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:08:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 12:08:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-03-17 12:08:38,131 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 29 [2025-03-17 12:08:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-03-17 12:08:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-03-17 12:08:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:08:38,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:38,131 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] [2025-03-17 12:08:38,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:08:38,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:38,336 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:38,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash -534040988, now seen corresponding path program 1 times [2025-03-17 12:08:38,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:38,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274385932] [2025-03-17 12:08:38,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:38,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:08:38,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:08:38,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:38,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:38,398 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:08:38,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:38,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274385932] [2025-03-17 12:08:38,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274385932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:38,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832689296] [2025-03-17 12:08:38,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:38,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:38,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:38,400 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:08:38,402 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:08:38,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:08:38,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:08:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:38,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:08:38,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:38,538 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:08:38,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:38,557 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:08:38,558 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:08:38,573 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:08:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832689296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:38,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:38,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-17 12:08:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541525622] [2025-03-17 12:08:38,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:38,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:08:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:38,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:08:38,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:38,575 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:38,622 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2025-03-17 12:08:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:08:38,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2025-03-17 12:08:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:38,623 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:08:38,623 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:08:38,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:08:38,624 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:38,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:08:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:08:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-17 12:08:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.35) internal successors, (81), 73 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2025-03-17 12:08:38,626 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 37 [2025-03-17 12:08:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:38,626 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2025-03-17 12:08:38,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2025-03-17 12:08:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:08:38,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:38,627 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] [2025-03-17 12:08:38,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 12:08:38,832 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash -534040987, now seen corresponding path program 1 times [2025-03-17 12:08:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082064840] [2025-03-17 12:08:38,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:38,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:08:38,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:08:38,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:38,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:38,975 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:38,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:38,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082064840] [2025-03-17 12:08:38,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082064840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:38,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028376528] [2025-03-17 12:08:38,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:38,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:38,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:38,977 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:08:38,979 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:08:39,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:08:39,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:08:39,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:39,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:39,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:08:39,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:39,208 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:39,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:39,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:39,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:08:39,398 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:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028376528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:39,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-03-17 12:08:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498716491] [2025-03-17 12:08:39,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 12:08:39,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:39,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 12:08:39,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:08:39,399 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 21 states, 20 states have (on average 4.45) internal successors, (89), 18 states have internal predecessors, (89), 4 states have call successors, (4), 1 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:08:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:39,510 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2025-03-17 12:08:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:08:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.45) internal successors, (89), 18 states have internal predecessors, (89), 4 states have call successors, (4), 1 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 37 [2025-03-17 12:08:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:39,511 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:08:39,511 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:08:39,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:08:39,515 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:39,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 382 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:08:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-17 12:08:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 73 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2025-03-17 12:08:39,518 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 37 [2025-03-17 12:08:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:39,519 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2025-03-17 12:08:39,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.45) internal successors, (89), 18 states have internal predecessors, (89), 4 states have call successors, (4), 1 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:08:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2025-03-17 12:08:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:08:39,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:39,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:39,526 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:08:39,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:39,720 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2126628513, now seen corresponding path program 1 times [2025-03-17 12:08:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765071284] [2025-03-17 12:08:39,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:39,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:39,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:39,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:39,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 12:08:40,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765071284] [2025-03-17 12:08:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765071284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880989749] [2025-03-17 12:08:40,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:40,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:40,098 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:08:40,100 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:08:40,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:40,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:40,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:40,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:40,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 12:08:40,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:40,237 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:40,238 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:40,253 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:08:40,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:40,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:08:40,347 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:40,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:08:40,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 12:08:40,370 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-03-17 12:08:40,385 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:08:40,385 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:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-03-17 12:08:40,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:40,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_960 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_960) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 12:08:40,539 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 12:08:40,539 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 33 treesize of output 32 [2025-03-17 12:08:40,608 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_959))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_960)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2025-03-17 12:08:40,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:40,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2025-03-17 12:08:40,618 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 278 treesize of output 224 [2025-03-17 12:08:40,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2025-03-17 12:08:40,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2025-03-17 12:08:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:40,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880989749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:40,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:40,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 14] total 31 [2025-03-17 12:08:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896087035] [2025-03-17 12:08:40,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:40,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:08:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:40,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:08:40,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=711, Unknown=21, NotChecked=168, Total=992 [2025-03-17 12:08:40,700 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 27 states have internal predecessors, (75), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 12:08:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:41,032 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2025-03-17 12:08:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:08:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 27 states have internal predecessors, (75), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 41 [2025-03-17 12:08:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:41,033 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:08:41,033 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:08:41,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=1036, Unknown=21, NotChecked=204, Total=1406 [2025-03-17 12:08:41,034 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:41,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 509 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 450 Invalid, 0 Unknown, 119 Unchecked, 0.2s Time] [2025-03-17 12:08:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:08:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 12:08:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3) internal successors, (78), 71 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2025-03-17 12:08:41,036 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 41 [2025-03-17 12:08:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:41,036 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2025-03-17 12:08:41,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 27 states have internal predecessors, (75), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 12:08:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2025-03-17 12:08:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:08:41,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:41,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:41,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 12:08:41,240 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,SelfDestructingSolverStorable22 [2025-03-17 12:08:41,240 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:41,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2126628512, now seen corresponding path program 1 times [2025-03-17 12:08:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852219447] [2025-03-17 12:08:41,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:41,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:41,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:41,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:41,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:41,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:41,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852219447] [2025-03-17 12:08:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852219447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:41,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392730734] [2025-03-17 12:08:41,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:41,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:41,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:41,829 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:08:41,830 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:08:41,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:41,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:41,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:41,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:41,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 12:08:41,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:41,949 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:41,983 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:41,983 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:42,007 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 13 treesize of output 9 [2025-03-17 12:08:42,011 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:08:42,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:42,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:08:42,087 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 30 treesize of output 13 [2025-03-17 12:08:42,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:42,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:08:42,145 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 30 treesize of output 13 [2025-03-17 12:08:42,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 12:08:42,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:08:42,210 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#length| (store |c_old(#length)| alloc_and_zero_~pi~0.base 16))) is different from true [2025-03-17 12:08:42,227 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:08:42,227 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:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 12:08:42,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392730734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:42,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2025-03-17 12:08:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609181058] [2025-03-17 12:08:42,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:08:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:42,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:08:42,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=788, Unknown=1, NotChecked=56, Total=930 [2025-03-17 12:08:42,325 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:08:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:42,809 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2025-03-17 12:08:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:08:42,810 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-17 12:08:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:42,810 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:08:42,810 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:08:42,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=1315, Unknown=1, NotChecked=74, Total=1560 [2025-03-17 12:08:42,811 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:42,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 554 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 550 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2025-03-17 12:08:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:08:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 12:08:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 67 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2025-03-17 12:08:42,814 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 41 [2025-03-17 12:08:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:42,814 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2025-03-17 12:08:42,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:08:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2025-03-17 12:08:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:08:42,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:42,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:42,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 12:08:43,016 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:08:43,016 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1056217936, now seen corresponding path program 1 times [2025-03-17 12:08:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128183098] [2025-03-17 12:08:43,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:08:43,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:08:43,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:43,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:43,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128183098] [2025-03-17 12:08:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128183098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007936129] [2025-03-17 12:08:43,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:43,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:43,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:43,524 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:08:43,525 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:08:43,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:08:43,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:08:43,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:43,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:43,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 12:08:43,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:43,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:43,730 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:43,749 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:08:43,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:43,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-17 12:08:43,835 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:43,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:08:43,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 12:08:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:43,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:43,950 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 12:08:43,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 12:08:44,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1176))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1177) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)))))) is different from false [2025-03-17 12:08:44,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:44,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2025-03-17 12:08:44,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:44,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 420 treesize of output 317 [2025-03-17 12:08:44,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:44,084 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 82 treesize of output 63 [2025-03-17 12:08:44,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2025-03-17 12:08:44,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007936129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:44,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:44,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 28 [2025-03-17 12:08:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906986301] [2025-03-17 12:08:44,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:44,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:08:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:44,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:08:44,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1052, Unknown=26, NotChecked=66, Total=1260 [2025-03-17 12:08:44,200 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:44,517 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-03-17 12:08:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:08:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2025-03-17 12:08:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:44,518 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:08:44,518 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:08:44,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1509, Unknown=26, NotChecked=80, Total=1806 [2025-03-17 12:08:44,519 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:44,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 466 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:08:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-17 12:08:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.253968253968254) internal successors, (79), 70 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2025-03-17 12:08:44,521 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 40 [2025-03-17 12:08:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:44,521 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2025-03-17 12:08:44,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 25 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2025-03-17 12:08:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:08:44,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:44,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:44,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:08:44,725 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:08:44,725 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:44,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1056217935, now seen corresponding path program 1 times [2025-03-17 12:08:44,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:44,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234869820] [2025-03-17 12:08:44,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:44,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:08:44,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:08:44,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:44,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234869820] [2025-03-17 12:08:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234869820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79453185] [2025-03-17 12:08:45,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:45,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:45,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:45,352 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:08:45,354 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:08:45,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:08:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:08:45,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:45,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-17 12:08:45,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:45,471 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:45,609 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:45,609 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:45,636 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:08:45,641 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 13 treesize of output 9 [2025-03-17 12:08:45,722 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:45,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2025-03-17 12:08:45,726 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 30 treesize of output 13 [2025-03-17 12:08:45,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:08:45,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 12:08:45,784 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 30 treesize of output 13 [2025-03-17 12:08:45,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 12:08:45,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:08:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:45,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:46,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,007 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 48 treesize of output 52 [2025-03-17 12:08:46,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem11#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1277) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))) (forall ((v_ArrVal_1276 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1276) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) (+ 5 |c_ULTIMATE.start_create_#t~mem11#1.offset|))) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))))) is different from false [2025-03-17 12:08:46,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1277 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1277) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (forall ((v_ArrVal_1276 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1276) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) 5)))))) is different from false [2025-03-17 12:08:46,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1275))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (= (select (select (store .cse0 .cse1 v_ArrVal_1277) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1275 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1274) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1275) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1274))) (< (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1275) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_1276) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) (+ 5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))))))) is different from false [2025-03-17 12:08:46,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_1275))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1277) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))))) (forall ((v_ArrVal_1275 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_1274) (select (select (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_1275) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_prenex_2) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_1274))) (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_1275) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_1276) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) (+ 5 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3)))))))) is different from false [2025-03-17 12:08:46,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2025-03-17 12:08:46,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 498 treesize of output 395 [2025-03-17 12:08:46,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,109 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 335 treesize of output 279 [2025-03-17 12:08:46,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 239 [2025-03-17 12:08:46,221 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:08:46,222 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 1 [2025-03-17 12:08:46,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,230 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-03-17 12:08:46,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:08:46,234 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-17 12:08:46,236 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:46,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-17 12:08:46,239 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:08:46,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:46,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 12:08:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79453185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:46,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:46,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2025-03-17 12:08:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760360190] [2025-03-17 12:08:46,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:46,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 12:08:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:46,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 12:08:46,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1369, Unknown=4, NotChecked=308, Total=1806 [2025-03-17 12:08:46,324 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:46,719 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-03-17 12:08:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:08:46,719 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2025-03-17 12:08:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:46,720 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:08:46,720 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:08:46,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=1890, Unknown=4, NotChecked=364, Total=2450 [2025-03-17 12:08:46,721 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:46,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 717 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:08:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-17 12:08:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-17 12:08:46,722 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 40 [2025-03-17 12:08:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:46,722 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-17 12:08:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-17 12:08:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:08:46,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:46,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:46,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 12:08:46,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:08:46,924 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:46,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1616977440, now seen corresponding path program 1 times [2025-03-17 12:08:46,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:46,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151377632] [2025-03-17 12:08:46,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:46,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:46,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:46,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:08:46,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151377632] [2025-03-17 12:08:46,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151377632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165967338] [2025-03-17 12:08:46,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:46,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:46,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 12:08:47,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:47,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:47,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:47,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:47,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:08:47,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:08:47,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:47,152 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:08:47,153 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:08:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:08:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165967338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:08:47,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:08:47,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-03-17 12:08:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993170873] [2025-03-17 12:08:47,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:47,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:08:47,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:47,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:08:47,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:47,170 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:47,231 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2025-03-17 12:08:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:08:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-17 12:08:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:47,232 INFO L225 Difference]: With dead ends: 83 [2025-03-17 12:08:47,232 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 12:08:47,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:08:47,233 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:47,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:08:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 12:08:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-03-17 12:08:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-03-17 12:08:47,235 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 41 [2025-03-17 12:08:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:47,235 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-03-17 12:08:47,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:08:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-03-17 12:08:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:08:47,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:47,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:47,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 12:08:47,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:47,436 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1616977441, now seen corresponding path program 1 times [2025-03-17 12:08:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962703890] [2025-03-17 12:08:47,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:47,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:47,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:47,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:47,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:47,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:08:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962703890] [2025-03-17 12:08:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962703890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583536776] [2025-03-17 12:08:47,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:08:47,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:47,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:47,550 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:47,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 12:08:47,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:08:47,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:08:47,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:08:47,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:47,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:08:47,666 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,782 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:08:47,782 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:47,804 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:08:47,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 11 treesize of output 5 [2025-03-17 12:08:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:47,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583536776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:48,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:08:48,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 21 [2025-03-17 12:08:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957885990] [2025-03-17 12:08:48,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:08:48,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 12:08:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:08:48,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 12:08:48,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-03-17 12:08:48,151 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 18 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:08:48,478 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-03-17 12:08:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:08:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 18 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2025-03-17 12:08:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:08:48,478 INFO L225 Difference]: With dead ends: 82 [2025-03-17 12:08:48,478 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 12:08:48,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 12:08:48,479 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:08:48,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 429 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:08:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 12:08:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-17 12:08:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:08:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-03-17 12:08:48,481 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 41 [2025-03-17 12:08:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:08:48,481 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-03-17 12:08:48,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 18 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:08:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-03-17 12:08:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 12:08:48,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:08:48,481 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:08:48,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 12:08:48,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:08:48,684 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2025-03-17 12:08:48,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:08:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash -858129692, now seen corresponding path program 2 times [2025-03-17 12:08:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:08:48,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029565780] [2025-03-17 12:08:48,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:08:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:08:48,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 12:08:48,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:08:48,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:08:48,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:49,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:08:49,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029565780] [2025-03-17 12:08:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029565780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:08:49,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053012792] [2025-03-17 12:08:49,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:08:49,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:08:49,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:08:49,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:08:49,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 12:08:49,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 12:08:49,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:08:49,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:08:49,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:08:49,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-03-17 12:08:49,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:08:49,667 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,790 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:49,794 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:49,817 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:08:49,817 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:49,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-17 12:08:49,872 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:49,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:49,998 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2025-03-17 12:08:49,998 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 60 [2025-03-17 12:08:50,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:50,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29 [2025-03-17 12:08:50,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:50,088 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2025-03-17 12:08:50,088 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 68 [2025-03-17 12:08:50,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:08:50,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 29 [2025-03-17 12:08:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:08:50,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:08:50,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse1 (+ |c_ULTIMATE.start_create_#t~mem11#1.offset| 12))) (and (forall ((v_ArrVal_1570 (Array Int Int))) (or (not (= v_ArrVal_1570 (store .cse0 .cse1 (select v_ArrVal_1570 .cse1)))) (forall ((v_ArrVal_1571 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_1571 .cse1)) v_ArrVal_1571)) (= (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1570))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1571) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4)) (+ 4 (select (select .cse3 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4)))) 0))))) (forall ((v_ArrVal_1570 (Array Int Int))) (or (forall ((v_ArrVal_1571 (Array Int Int))) (or (= (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1571))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4))) (+ 4 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1570) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4))) 0) (not (= (store .cse2 .cse1 (select v_ArrVal_1571 .cse1)) v_ArrVal_1571)))) (not (= v_ArrVal_1570 (store .cse0 .cse1 (select v_ArrVal_1570 .cse1)))))))) is different from false [2025-03-17 12:08:50,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse5 (select |c_#memory_$Pointer$#0.offset| .cse2)) (.cse3 (select |c_#memory_$Pointer$#0.base| .cse2)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int)) (or (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12))) (or (forall ((v_ArrVal_1571 (Array Int Int))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1571))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1570) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4)) 0) (not (= v_ArrVal_1571 (store .cse3 .cse4 (select v_ArrVal_1571 .cse4)))))) (not (= (store .cse5 .cse4 (select v_ArrVal_1570 .cse4)) v_ArrVal_1570))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| .cse6))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int)) (or (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse7 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12))) (or (not (= (store .cse5 .cse7 (select v_ArrVal_1570 .cse7)) v_ArrVal_1570)) (forall ((v_ArrVal_1571 (Array Int Int))) (or (not (= v_ArrVal_1571 (store .cse3 .cse7 (select v_ArrVal_1571 .cse7)))) (= (let ((.cse8 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1570))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1571) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (+ (select (select .cse8 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| .cse6))))))) is different from false [2025-03-17 12:08:50,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int) (v_ArrVal_1569 Int) (v_ArrVal_1568 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1568)))) (or (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1569)))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse2 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1570 .cse2)) v_ArrVal_1570)) (forall ((v_ArrVal_1571 (Array Int Int))) (or (= (select (let ((.cse3 (store .cse5 .cse1 v_ArrVal_1571))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4))) (+ (select (select (store .cse0 .cse1 v_ArrVal_1570) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4)) 0) (not (= (store (select .cse5 .cse1) .cse2 (select v_ArrVal_1571 .cse2)) v_ArrVal_1571)))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int) (v_ArrVal_1569 Int) (v_ArrVal_1568 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1568)))) (or (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1569)))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse11 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12))) (or (not (= (store (select .cse9 .cse10) .cse11 (select v_ArrVal_1570 .cse11)) v_ArrVal_1570)) (forall ((v_ArrVal_1571 (Array Int Int))) (or (= (let ((.cse12 (store .cse9 .cse10 v_ArrVal_1570))) (select (select .cse12 (select (select (store .cse13 .cse10 v_ArrVal_1571) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4)) (+ (select (select .cse12 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4))) 0) (not (= (store (select .cse13 .cse10) .cse11 (select v_ArrVal_1571 .cse11)) v_ArrVal_1571)))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))))) is different from false [2025-03-17 12:08:50,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (let ((.cse6 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$#0.offset| .cse7)) (.cse10 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int) (v_ArrVal_1569 Int) (v_ArrVal_1568 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1568)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1569)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse4 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12))) (or (forall ((v_ArrVal_1571 (Array Int Int))) (or (not (= v_ArrVal_1571 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_1571 .cse4)))) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_1571))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) (+ (select (select (store .cse0 .cse3 v_ArrVal_1570) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4)) 0))) (not (= v_ArrVal_1570 (store (select .cse0 .cse3) .cse4 (select v_ArrVal_1570 .cse4))))))))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int) (v_ArrVal_1569 Int) (v_ArrVal_1568 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1568)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1569)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse14 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12))) (or (forall ((v_ArrVal_1571 (Array Int Int))) (or (not (= v_ArrVal_1571 (store (select .cse12 .cse13) .cse14 (select v_ArrVal_1571 .cse14)))) (= (let ((.cse15 (store .cse11 .cse13 v_ArrVal_1570))) (select (select .cse15 (select (select (store .cse12 .cse13 v_ArrVal_1571) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)) (+ (select (select .cse15 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4))) 0))) (not (= v_ArrVal_1570 (store (select .cse11 .cse13) .cse14 (select v_ArrVal_1570 .cse14))))))))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))))))) is different from false [2025-03-17 12:08:50,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse6 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_33|) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int) (v_ArrVal_1569 Int) (v_ArrVal_1568 Int)) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1568)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1569)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse4 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12))) (or (forall ((v_ArrVal_1571 (Array Int Int))) (or (not (= v_ArrVal_1571 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_1571 .cse4)))) (= (let ((.cse5 (store .cse0 .cse3 v_ArrVal_1570))) (select (select .cse5 (select (select (store .cse2 .cse3 v_ArrVal_1571) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4))) 0))) (not (= v_ArrVal_1570 (store (select .cse0 .cse3) .cse4 (select v_ArrVal_1570 .cse4))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_33|) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_34| Int) (v_ArrVal_1569 Int) (v_ArrVal_1568 Int)) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1568)))) (or (forall ((v_ArrVal_1570 (Array Int Int))) (let ((.cse14 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1569)))) (let ((.cse13 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_34| 12)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_1570 (store (select .cse11 .cse12) .cse13 (select v_ArrVal_1570 .cse13)))) (forall ((v_ArrVal_1571 (Array Int Int))) (or (not (= v_ArrVal_1571 (store (select .cse14 .cse12) .cse13 (select v_ArrVal_1571 .cse13)))) (= (select (let ((.cse15 (store .cse14 .cse12 v_ArrVal_1571))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) (+ (select (select (store .cse11 .cse12 v_ArrVal_1570) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4)) 0))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_34| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))))))) is different from false [2025-03-17 12:08:51,560 INFO L349 Elim1Store]: treesize reduction 1275, result has 38.3 percent of original size [2025-03-17 12:08:51,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 648018 treesize of output 596425 [2025-03-17 12:08:52,488 INFO L349 Elim1Store]: treesize reduction 291, result has 34.8 percent of original size [2025-03-17 12:08:52,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 37 case distinctions, treesize of input 770362 treesize of output 502638 [2025-03-17 12:08:58,053 INFO L349 Elim1Store]: treesize reduction 416, result has 31.1 percent of original size [2025-03-17 12:08:58,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 46 case distinctions, treesize of input 82695 treesize of output 56964 [2025-03-17 12:09:00,153 INFO L349 Elim1Store]: treesize reduction 1010, result has 27.7 percent of original size [2025-03-17 12:09:00,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 79036 treesize of output 77393 [2025-03-17 12:09:01,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:01,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 78981 treesize of output 56165 [2025-03-17 12:09:03,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:09:03,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 53413 treesize of output 52985