./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/test-0232-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:48:38,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:48:39,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:48:39,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:48:39,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:48:39,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:48:39,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:48:39,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:48:39,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:48:39,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:48:39,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:48:39,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:48:39,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:48:39,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:48:39,062 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:48:39,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:48:39,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:48:39,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:48:39,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:48:39,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:48:39,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:48:39,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:48:39,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:48:39,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:39,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:48:39,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:48:39,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:48:39,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:48:39,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:48:39,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:48:39,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:48:39,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:48:39,065 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2025-03-08 22:48:39,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:48:39,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:48:39,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:48:39,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:48:39,261 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:48:39,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-3.i [2025-03-08 22:48:40,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f86baf58/8074d4656f27477a863a76f9d16e52a4/FLAGbbe1a114b [2025-03-08 22:48:40,606 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:48:40,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2025-03-08 22:48:40,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f86baf58/8074d4656f27477a863a76f9d16e52a4/FLAGbbe1a114b [2025-03-08 22:48:40,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f86baf58/8074d4656f27477a863a76f9d16e52a4 [2025-03-08 22:48:40,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:48:40,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:48:40,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:40,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:48:40,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:48:40,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:40" (1/1) ... [2025-03-08 22:48:40,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139279b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:40, skipping insertion in model container [2025-03-08 22:48:40,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:40" (1/1) ... [2025-03-08 22:48:40,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:48:41,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:41,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:48:41,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:41,199 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:48:41,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41 WrapperNode [2025-03-08 22:48:41,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:41,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:41,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:48:41,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:48:41,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,237 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-03-08 22:48:41,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:41,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:48:41,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:48:41,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:48:41,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,263 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2025-03-08 22:48:41,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:48:41,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:48:41,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:48:41,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:48:41,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (1/1) ... [2025-03-08 22:48:41,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:41,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:41,305 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-08 22:48:41,308 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-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:48:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:48:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:48:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:48:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:48:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:48:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:48:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:48:41,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:48:41,422 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:48:41,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:48:41,677 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-08 22:48:41,693 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-08 22:48:41,693 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:48:41,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:48:41,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:48:41,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:41 BoogieIcfgContainer [2025-03-08 22:48:41,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:48:41,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:48:41,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:48:41,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:48:41,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:48:40" (1/3) ... [2025-03-08 22:48:41,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2322a1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:41, skipping insertion in model container [2025-03-08 22:48:41,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:41" (2/3) ... [2025-03-08 22:48:41,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2322a1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:41, skipping insertion in model container [2025-03-08 22:48:41,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:41" (3/3) ... [2025-03-08 22:48:41,711 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2025-03-08 22:48:41,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:48:41,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232-3.i that has 1 procedures, 108 locations, 1 initial locations, 2 loop locations, and 55 error locations. [2025-03-08 22:48:41,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:48:41,760 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;@2d67aa15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:48:41,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-03-08 22:48:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 107 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:48:41,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:41,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:48:41,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 4431840, now seen corresponding path program 1 times [2025-03-08 22:48:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-03-08 22:48:41,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:41,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:48:41,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:48:41,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:41,882 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-08 22:48:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-03-08 22:48:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738879007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446180846] [2025-03-08 22:48:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:41,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:48:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:41,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:48:41,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:48:41,909 INFO L87 Difference]: Start difference. First operand has 108 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 107 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:41,921 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2025-03-08 22:48:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:48:41,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:48:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:41,928 INFO L225 Difference]: With dead ends: 108 [2025-03-08 22:48:41,930 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 22:48:41,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:48:41,934 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:41,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 22:48:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-08 22:48:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 51 states have (on average 2.156862745098039) internal successors, (110), 105 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2025-03-08 22:48:41,969 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 4 [2025-03-08 22:48:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:41,969 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2025-03-08 22:48:41,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2025-03-08 22:48:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:48:41,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:41,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:48:41,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:48:41,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:41,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash 4431838, now seen corresponding path program 1 times [2025-03-08 22:48:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:41,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-08 22:48:41,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:41,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:48:41,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:48:41,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:41,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:42,147 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-08 22:48:42,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-08 22:48:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038127040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:42,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:42,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017334542] [2025-03-08 22:48:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:42,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:42,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:42,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:42,149 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:42,298 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-03-08 22:48:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:42,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:48:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:42,299 INFO L225 Difference]: With dead ends: 99 [2025-03-08 22:48:42,299 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 22:48:42,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:42,300 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:42,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 90 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 22:48:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 22:48:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 52 states have (on average 2.0) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-03-08 22:48:42,307 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 4 [2025-03-08 22:48:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:42,307 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-03-08 22:48:42,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-03-08 22:48:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:48:42,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:42,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:48:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:48:42,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:42,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:42,310 INFO L85 PathProgramCache]: Analyzing trace with hash 4431839, now seen corresponding path program 1 times [2025-03-08 22:48:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254471581] [2025-03-08 22:48:42,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:42,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:42,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:48:42,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:48:42,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:42,425 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-08 22:48:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254471581] [2025-03-08 22:48:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254471581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:42,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:42,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:42,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260005951] [2025-03-08 22:48:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:42,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:42,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:42,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:42,427 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:42,590 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2025-03-08 22:48:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-08 22:48:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:42,591 INFO L225 Difference]: With dead ends: 126 [2025-03-08 22:48:42,591 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 22:48:42,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:42,592 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 87 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:42,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 108 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 22:48:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-03-08 22:48:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 105 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2025-03-08 22:48:42,601 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 4 [2025-03-08 22:48:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:42,601 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2025-03-08 22:48:42,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2025-03-08 22:48:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:48:42,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:42,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:48:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:48:42,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 137387053, now seen corresponding path program 1 times [2025-03-08 22:48:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950756697] [2025-03-08 22:48:42,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:42,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:42,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:48:42,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:48:42,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:42,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:42,646 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-08 22:48:42,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:42,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950756697] [2025-03-08 22:48:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950756697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:42,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:42,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967868610] [2025-03-08 22:48:42,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:42,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:42,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:42,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:42,648 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:42,700 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2025-03-08 22:48:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:42,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:48:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:42,701 INFO L225 Difference]: With dead ends: 102 [2025-03-08 22:48:42,701 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 22:48:42,701 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-08 22:48:42,702 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:42,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 22:48:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-08 22:48:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 101 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-03-08 22:48:42,705 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 5 [2025-03-08 22:48:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-03-08 22:48:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-03-08 22:48:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:48:42,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:42,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:48:42,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:48:42,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:42,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash 137387054, now seen corresponding path program 1 times [2025-03-08 22:48:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613126615] [2025-03-08 22:48:42,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:42,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:48:42,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:48:42,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:42,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:42,763 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-08 22:48:42,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:42,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613126615] [2025-03-08 22:48:42,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613126615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:42,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:42,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:42,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27000139] [2025-03-08 22:48:42,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:42,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:42,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:42,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:42,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:42,764 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:42,806 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2025-03-08 22:48:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:48:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:42,808 INFO L225 Difference]: With dead ends: 98 [2025-03-08 22:48:42,808 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 22:48:42,808 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-08 22:48:42,809 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:42,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 22:48:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 22:48:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-03-08 22:48:42,814 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 5 [2025-03-08 22:48:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:42,814 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-03-08 22:48:42,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-03-08 22:48:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:48:42,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:42,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:42,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:48:42,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:42,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -458794855, now seen corresponding path program 1 times [2025-03-08 22:48:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:42,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-08 22:48:42,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:42,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:48:42,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:48:42,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:42,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,011 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-08 22:48:43,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-08 22:48:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372854327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549453840] [2025-03-08 22:48:43,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:43,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:48:43,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:43,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:48:43,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:43,013 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:43,163 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2025-03-08 22:48:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:48:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:43,164 INFO L225 Difference]: With dead ends: 108 [2025-03-08 22:48:43,164 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 22:48:43,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:43,165 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 20 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:43,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 456 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 22:48:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-03-08 22:48:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2025-03-08 22:48:43,174 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 10 [2025-03-08 22:48:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:43,174 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2025-03-08 22:48:43,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2025-03-08 22:48:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:48:43,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:43,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:43,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:48:43,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1337775234, now seen corresponding path program 1 times [2025-03-08 22:48:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989418788] [2025-03-08 22:48:43,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:43,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:48:43,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:48:43,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,295 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-08 22:48:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:43,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989418788] [2025-03-08 22:48:43,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989418788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:43,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:43,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998396497] [2025-03-08 22:48:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:43,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:43,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:43,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:43,296 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:43,350 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-03-08 22:48:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:43,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:48:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:43,351 INFO L225 Difference]: With dead ends: 103 [2025-03-08 22:48:43,351 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 22:48:43,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:43,358 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 92 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:43,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 119 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 22:48:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2025-03-08 22:48:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 99 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-03-08 22:48:43,365 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 11 [2025-03-08 22:48:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:43,365 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-03-08 22:48:43,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-03-08 22:48:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:48:43,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:43,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:43,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:48:43,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:43,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash 294216983, now seen corresponding path program 1 times [2025-03-08 22:48:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:43,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930562544] [2025-03-08 22:48:43,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:43,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:48:43,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:48:43,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,475 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-08 22:48:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930562544] [2025-03-08 22:48:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930562544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497643183] [2025-03-08 22:48:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:43,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:43,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:43,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:43,476 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:43,625 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2025-03-08 22:48:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:48:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:43,626 INFO L225 Difference]: With dead ends: 120 [2025-03-08 22:48:43,626 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 22:48:43,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:43,627 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 62 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:43,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 22:48:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2025-03-08 22:48:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-03-08 22:48:43,631 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 17 [2025-03-08 22:48:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:43,631 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-03-08 22:48:43,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-03-08 22:48:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:48:43,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:43,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:43,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:48:43,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash 294216984, now seen corresponding path program 1 times [2025-03-08 22:48:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838722956] [2025-03-08 22:48:43,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:43,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:48:43,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:48:43,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,809 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-08 22:48:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838722956] [2025-03-08 22:48:43,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838722956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:43,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:43,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:43,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028781802] [2025-03-08 22:48:43,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:43,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:43,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:43,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:43,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:43,810 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:43,934 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2025-03-08 22:48:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:48:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:43,935 INFO L225 Difference]: With dead ends: 121 [2025-03-08 22:48:43,936 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 22:48:43,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:43,936 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 77 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:43,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 166 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 22:48:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2025-03-08 22:48:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.621212121212121) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-03-08 22:48:43,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 17 [2025-03-08 22:48:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:43,942 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-03-08 22:48:43,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-03-08 22:48:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:48:43,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:43,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:43,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:48:43,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash -725411018, now seen corresponding path program 1 times [2025-03-08 22:48:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-08 22:48:43,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:43,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:48:43,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:48:43,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:44,045 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-08 22:48:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-08 22:48:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683317562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:44,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122729135] [2025-03-08 22:48:44,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:44,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:44,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:44,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:44,046 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:44,117 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2025-03-08 22:48:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:48:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:44,119 INFO L225 Difference]: With dead ends: 93 [2025-03-08 22:48:44,119 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 22:48:44,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:44,120 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:44,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 221 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 22:48:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-08 22:48:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2025-03-08 22:48:44,124 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 19 [2025-03-08 22:48:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:44,124 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2025-03-08 22:48:44,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2025-03-08 22:48:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:48:44,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:44,125 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] [2025-03-08 22:48:44,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:48:44,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:44,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1010070962, now seen corresponding path program 1 times [2025-03-08 22:48:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756354410] [2025-03-08 22:48:44,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:44,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:48:44,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:48:44,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:44,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:44,247 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-08 22:48:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:44,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756354410] [2025-03-08 22:48:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756354410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:44,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696086559] [2025-03-08 22:48:44,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:44,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:44,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:44,249 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:44,347 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-03-08 22:48:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:44,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 22:48:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:44,349 INFO L225 Difference]: With dead ends: 92 [2025-03-08 22:48:44,349 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 22:48:44,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:44,350 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:44,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 178 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 22:48:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-03-08 22:48:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.603448275862069) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-03-08 22:48:44,352 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 20 [2025-03-08 22:48:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:44,353 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-03-08 22:48:44,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2025-03-08 22:48:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:48:44,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:44,353 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] [2025-03-08 22:48:44,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:48:44,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1010070961, now seen corresponding path program 1 times [2025-03-08 22:48:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776154732] [2025-03-08 22:48:44,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:44,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:48:44,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:48:44,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:44,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:44,570 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-08 22:48:44,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:44,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776154732] [2025-03-08 22:48:44,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776154732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:44,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:44,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:48:44,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937719815] [2025-03-08 22:48:44,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:44,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:48:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:44,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:48:44,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:44,572 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:44,706 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-03-08 22:48:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:48:44,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 22:48:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:44,707 INFO L225 Difference]: With dead ends: 91 [2025-03-08 22:48:44,707 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 22:48:44,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:48:44,707 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:44,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 240 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 22:48:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-03-08 22:48:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2025-03-08 22:48:44,710 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 20 [2025-03-08 22:48:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:44,710 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2025-03-08 22:48:44,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2025-03-08 22:48:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:48:44,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:44,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:44,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:48:44,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:44,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1137839213, now seen corresponding path program 1 times [2025-03-08 22:48:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:44,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412423130] [2025-03-08 22:48:44,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:44,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:48:44,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:48:44,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:44,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412423130] [2025-03-08 22:48:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412423130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549884216] [2025-03-08 22:48:44,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:44,941 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-08 22:48:44,943 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-08 22:48:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:48:45,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:48:45,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:45,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:45,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 22:48:45,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:45,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:45,125 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-08 22:48:45,125 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 23 treesize of output 24 [2025-03-08 22:48:45,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 22:48:45,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:45,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 22:48:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:45,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:45,289 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 38 treesize of output 34 [2025-03-08 22:48:45,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:45,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2025-03-08 22:48:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:46,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549884216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:46,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:46,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-08 22:48:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569583375] [2025-03-08 22:48:46,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:46,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:48:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:46,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:48:46,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:48:46,096 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:46,358 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-03-08 22:48:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:46,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 22:48:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:46,360 INFO L225 Difference]: With dead ends: 90 [2025-03-08 22:48:46,360 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 22:48:46,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:46,361 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 87 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:46,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 356 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 22:48:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2025-03-08 22:48:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-03-08 22:48:46,363 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 21 [2025-03-08 22:48:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:46,363 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-03-08 22:48:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-03-08 22:48:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:48:46,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:46,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:46,375 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-08 22:48:46,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 22:48:46,566 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:46,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1137839212, now seen corresponding path program 1 times [2025-03-08 22:48:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:46,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-08 22:48:46,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:46,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:48:46,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:48:46,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:46,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-08 22:48:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134081385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70095627] [2025-03-08 22:48:46,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:46,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:46,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:46,827 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-08 22:48:46,830 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-08 22:48:46,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:48:46,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:48:46,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:46,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:46,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 22:48:46,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:46,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:46,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:47,040 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 22:48:47,040 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 24 treesize of output 27 [2025-03-08 22:48:47,054 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 22:48:47,054 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 15 treesize of output 15 [2025-03-08 22:48:47,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-08 22:48:47,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 22:48:47,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:47,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:47,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-08 22:48:47,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 22:48:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:47,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:47,342 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 66 treesize of output 62 [2025-03-08 22:48:47,345 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 102 treesize of output 94 [2025-03-08 22:48:47,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-08 22:48:47,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:47,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2025-03-08 22:48:47,506 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 68 treesize of output 64 [2025-03-08 22:48:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:47,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70095627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:47,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-08 22:48:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224456289] [2025-03-08 22:48:47,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:48:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:47,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:48:47,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:48:47,622 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:48,042 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-03-08 22:48:48,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:48,042 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 22:48:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:48,043 INFO L225 Difference]: With dead ends: 89 [2025-03-08 22:48:48,043 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 22:48:48,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:48:48,043 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 94 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:48,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 578 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 22:48:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-03-08 22:48:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-03-08 22:48:48,046 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 21 [2025-03-08 22:48:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:48,046 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-03-08 22:48:48,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-03-08 22:48:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:48:48,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:48,048 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-08 22:48:48,054 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-08 22:48:48,252 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,SelfDestructingSolverStorable13 [2025-03-08 22:48:48,252 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:48,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:48,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1247428718, now seen corresponding path program 1 times [2025-03-08 22:48:48,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:48,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153681018] [2025-03-08 22:48:48,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:48,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:48:48,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:48:48,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:48,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:48,422 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-08 22:48:48,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:48,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153681018] [2025-03-08 22:48:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153681018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:48,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:48,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:48,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481400594] [2025-03-08 22:48:48,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:48,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:48,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:48,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:48,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:48,423 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:48,578 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2025-03-08 22:48:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:48,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 22:48:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:48,579 INFO L225 Difference]: With dead ends: 124 [2025-03-08 22:48:48,579 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 22:48:48,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:48,581 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 36 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:48,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 290 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 22:48:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2025-03-08 22:48:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-03-08 22:48:48,584 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 21 [2025-03-08 22:48:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:48,584 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-03-08 22:48:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-03-08 22:48:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:48:48,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:48,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:48:48,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -15584564, now seen corresponding path program 1 times [2025-03-08 22:48:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-03-08 22:48:48,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:48,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:48:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:48:48,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:48,838 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-08 22:48:48,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-03-08 22:48:48,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814704855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:48,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:48,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:48,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326257952] [2025-03-08 22:48:48,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:48,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:48,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:48,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:48,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:48,839 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:49,020 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2025-03-08 22:48:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:48:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 22:48:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:49,022 INFO L225 Difference]: With dead ends: 123 [2025-03-08 22:48:49,022 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 22:48:49,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:49,022 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:49,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 244 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 22:48:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 100. [2025-03-08 22:48:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 99 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-03-08 22:48:49,024 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 22 [2025-03-08 22:48:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:49,025 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-03-08 22:48:49,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-03-08 22:48:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:48:49,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:49,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:49,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:48:49,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash -483121456, now seen corresponding path program 1 times [2025-03-08 22:48:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-08 22:48:49,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:49,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:48:49,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:48:49,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:49,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:49,239 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-08 22:48:49,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:49,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-08 22:48:49,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702436604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:49,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:49,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353787288] [2025-03-08 22:48:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:49,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:49,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:49,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:49,240 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:49,424 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2025-03-08 22:48:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:49,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 22:48:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:49,425 INFO L225 Difference]: With dead ends: 114 [2025-03-08 22:48:49,425 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 22:48:49,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:49,426 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:49,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 236 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 22:48:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2025-03-08 22:48:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.452054794520548) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-03-08 22:48:49,428 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 23 [2025-03-08 22:48:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:49,428 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-03-08 22:48:49,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-03-08 22:48:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:48:49,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:49,428 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-08 22:48:49,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:48:49,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:49,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2091863223, now seen corresponding path program 1 times [2025-03-08 22:48:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:49,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465394978] [2025-03-08 22:48:49,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:49,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:49,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:48:49,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:48:49,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:49,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:49,536 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-08 22:48:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465394978] [2025-03-08 22:48:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465394978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:49,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247563220] [2025-03-08 22:48:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:49,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:49,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:49,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:49,537 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:49,640 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-03-08 22:48:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:49,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:48:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:49,642 INFO L225 Difference]: With dead ends: 100 [2025-03-08 22:48:49,642 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 22:48:49,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:48:49,642 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 151 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:49,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 77 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 22:48:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 22:48:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 99 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-03-08 22:48:49,644 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 24 [2025-03-08 22:48:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:49,645 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-03-08 22:48:49,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-03-08 22:48:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:48:49,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:49,645 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-08 22:48:49,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:48:49,645 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2091863222, now seen corresponding path program 1 times [2025-03-08 22:48:49,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:49,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666407497] [2025-03-08 22:48:49,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:49,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:48:49,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:48:49,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:49,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:49,688 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-08 22:48:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666407497] [2025-03-08 22:48:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666407497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111113882] [2025-03-08 22:48:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:49,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:49,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:49,690 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:49,727 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2025-03-08 22:48:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:49,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:48:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:49,728 INFO L225 Difference]: With dead ends: 93 [2025-03-08 22:48:49,728 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 22:48:49,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:49,728 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:49,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 48 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 22:48:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 22:48:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-03-08 22:48:49,730 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 24 [2025-03-08 22:48:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:49,730 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-03-08 22:48:49,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-03-08 22:48:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:48:49,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:49,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:49,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:48:49,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:49,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash -423250450, now seen corresponding path program 1 times [2025-03-08 22:48:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-03-08 22:48:49,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:49,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:48:49,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:48:49,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:49,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:49,791 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-08 22:48:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:49,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-03-08 22:48:49,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438969946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:49,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682454154] [2025-03-08 22:48:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:49,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:49,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:49,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:49,792 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:49,837 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-03-08 22:48:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 22:48:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:49,838 INFO L225 Difference]: With dead ends: 92 [2025-03-08 22:48:49,838 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 22:48:49,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:49,838 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:49,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 22:48:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 22:48:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-03-08 22:48:49,840 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 25 [2025-03-08 22:48:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:49,840 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-03-08 22:48:49,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-03-08 22:48:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:48:49,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:49,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:49,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:48:49,841 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:49,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:49,841 INFO L85 PathProgramCache]: Analyzing trace with hash -235862041, now seen corresponding path program 1 times [2025-03-08 22:48:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:49,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743483043] [2025-03-08 22:48:49,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:49,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:49,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:49,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:49,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:49,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:49,927 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-08 22:48:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743483043] [2025-03-08 22:48:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743483043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903792960] [2025-03-08 22:48:49,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:49,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:49,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:49,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:49,929 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:50,005 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-03-08 22:48:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 22:48:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:50,006 INFO L225 Difference]: With dead ends: 94 [2025-03-08 22:48:50,006 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 22:48:50,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:50,007 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:50,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 22:48:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2025-03-08 22:48:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2025-03-08 22:48:50,009 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 26 [2025-03-08 22:48:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:50,009 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2025-03-08 22:48:50,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2025-03-08 22:48:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:48:50,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:50,009 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-08 22:48:50,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:48:50,010 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:50,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1278211340, now seen corresponding path program 1 times [2025-03-08 22:48:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:50,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238257082] [2025-03-08 22:48:50,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:50,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:48:50,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:48:50,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:50,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:50,235 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-08 22:48:50,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:50,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238257082] [2025-03-08 22:48:50,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238257082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:50,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:48:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400386059] [2025-03-08 22:48:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:50,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:50,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:50,236 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:50,524 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2025-03-08 22:48:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:48:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 22:48:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:50,525 INFO L225 Difference]: With dead ends: 111 [2025-03-08 22:48:50,525 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 22:48:50,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:48:50,526 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 69 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:50,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 290 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 22:48:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2025-03-08 22:48:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2025-03-08 22:48:50,528 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 27 [2025-03-08 22:48:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:50,528 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2025-03-08 22:48:50,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2025-03-08 22:48:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:48:50,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:50,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:50,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:48:50,528 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:50,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash 969845892, now seen corresponding path program 1 times [2025-03-08 22:48:50,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:50,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271477688] [2025-03-08 22:48:50,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:50,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:50,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:48:50,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:48:50,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:50,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:50,637 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-08 22:48:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271477688] [2025-03-08 22:48:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271477688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:50,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866004811] [2025-03-08 22:48:50,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:50,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:50,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:50,639 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:50,726 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-03-08 22:48:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:48:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 22:48:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:50,727 INFO L225 Difference]: With dead ends: 94 [2025-03-08 22:48:50,727 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 22:48:50,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:48:50,728 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:50,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 114 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 22:48:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 22:48:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2025-03-08 22:48:50,730 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 28 [2025-03-08 22:48:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:50,730 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2025-03-08 22:48:50,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2025-03-08 22:48:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:48:50,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:50,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:50,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:48:50,732 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:50,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 445974822, now seen corresponding path program 1 times [2025-03-08 22:48:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:50,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700157820] [2025-03-08 22:48:50,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:50,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:50,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:48:50,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:48:50,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:50,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:51,134 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-08 22:48:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700157820] [2025-03-08 22:48:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700157820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:48:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566363766] [2025-03-08 22:48:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:51,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:51,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:51,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:51,135 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:51,316 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2025-03-08 22:48:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 22:48:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:51,316 INFO L225 Difference]: With dead ends: 121 [2025-03-08 22:48:51,317 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 22:48:51,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:48:51,317 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:51,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 492 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 22:48:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2025-03-08 22:48:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.22) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2025-03-08 22:48:51,319 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 33 [2025-03-08 22:48:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2025-03-08 22:48:51,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2025-03-08 22:48:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:48:51,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:51,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:48:51,320 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:51,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 445974758, now seen corresponding path program 1 times [2025-03-08 22:48:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112093780] [2025-03-08 22:48:51,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:51,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:48:51,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:48:51,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:51,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:51,981 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-08 22:48:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:51,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112093780] [2025-03-08 22:48:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112093780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:51,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 22:48:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960545268] [2025-03-08 22:48:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:51,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:48:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:51,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:48:51,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:48:51,983 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:52,418 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2025-03-08 22:48:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:48:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 22:48:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:52,419 INFO L225 Difference]: With dead ends: 120 [2025-03-08 22:48:52,419 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 22:48:52,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:52,420 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:52,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 402 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 22:48:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-08 22:48:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 98 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2025-03-08 22:48:52,422 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 33 [2025-03-08 22:48:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:52,422 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2025-03-08 22:48:52,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2025-03-08 22:48:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 22:48:52,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:52,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:52,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:48:52,422 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:52,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash -821889566, now seen corresponding path program 1 times [2025-03-08 22:48:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:52,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629513126] [2025-03-08 22:48:52,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:52,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:48:52,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:48:52,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:52,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:48:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629513126] [2025-03-08 22:48:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629513126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569401461] [2025-03-08 22:48:53,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:53,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:53,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:53,098 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-08 22:48:53,100 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-08 22:48:53,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:48:53,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:48:53,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:53,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:53,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-08 22:48:53,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:53,299 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-08 22:48:53,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:53,357 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-08 22:48:53,393 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 22:48:53,393 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 15 treesize of output 15 [2025-03-08 22:48:53,486 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-08 22:48:53,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 22:48:53,612 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 19 treesize of output 11 [2025-03-08 22:48:53,768 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:53,772 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:48:53,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2025-03-08 22:48:53,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:48:53,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2025-03-08 22:48:53,962 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 38 treesize of output 22 [2025-03-08 22:48:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:54,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:54,324 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 84 treesize of output 76 [2025-03-08 22:48:54,327 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 130 treesize of output 122 [2025-03-08 22:48:54,782 INFO L349 Elim1Store]: treesize reduction 66, result has 77.3 percent of original size [2025-03-08 22:48:54,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 983 treesize of output 1142 [2025-03-08 22:48:54,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:54,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 470 treesize of output 624 [2025-03-08 22:49:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:00,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569401461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:49:00,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:49:00,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2025-03-08 22:49:00,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853261682] [2025-03-08 22:49:00,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:49:00,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 22:49:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:00,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 22:49:00,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 22:49:00,878 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 42 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:02,023 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2025-03-08 22:49:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 22:49:02,024 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 42 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-08 22:49:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:02,024 INFO L225 Difference]: With dead ends: 113 [2025-03-08 22:49:02,024 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 22:49:02,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=583, Invalid=2839, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 22:49:02,025 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 87 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:02,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 828 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:49:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 22:49:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2025-03-08 22:49:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-03-08 22:49:02,027 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 35 [2025-03-08 22:49:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:02,027 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-03-08 22:49:02,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 42 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-03-08 22:49:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:49:02,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:02,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:02,034 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-08 22:49:02,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:02,232 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:49:02,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 291227260, now seen corresponding path program 1 times [2025-03-08 22:49:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:02,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420931571] [2025-03-08 22:49:02,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:02,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:49:02,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:49:02,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:02,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:49:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420931571] [2025-03-08 22:49:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420931571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800242552] [2025-03-08 22:49:02,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:02,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:02,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:02,734 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-08 22:49:02,736 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-08 22:49:02,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:49:02,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:49:02,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:02,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:02,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-08 22:49:02,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:49:02,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:49:02,960 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-08 22:49:02,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:49:02,995 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 22:49:02,995 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 15 treesize of output 15 [2025-03-08 22:49:03,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 22:49:03,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2025-03-08 22:49:03,189 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 19 treesize of output 11 [2025-03-08 22:49:03,360 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:49:03,366 INFO L349 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2025-03-08 22:49:03,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 44 [2025-03-08 22:49:03,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2025-03-08 22:49:03,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:49:03,539 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 64 treesize of output 40 [2025-03-08 22:49:03,571 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:49:03,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 19 [2025-03-08 22:49:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:03,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:49:04,022 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 84 treesize of output 76 [2025-03-08 22:49:04,024 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 138 treesize of output 130 [2025-03-08 22:49:04,903 INFO L349 Elim1Store]: treesize reduction 66, result has 86.2 percent of original size [2025-03-08 22:49:04,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1283 treesize of output 1611 [2025-03-08 22:49:05,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:49:05,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1114 treesize of output 1384