./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0217_1.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/list-ext-properties/test-0217_1.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 e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:46:26,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:46:26,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:46:26,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:46:26,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:46:26,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:46:26,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:46:26,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:46:26,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:46:26,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:46:26,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:46:26,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:46:26,424 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:46:26,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:46:26,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:46:26,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:46:26,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:46:26,426 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 -> e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a [2025-03-08 22:46:26,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:46:26,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:46:26,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:46:26,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:46:26,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:46:26,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0217_1.i [2025-03-08 22:46:27,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287175c16/404872ef4c0d40b7ae489dfbb8921d40/FLAGcee138016 [2025-03-08 22:46:28,023 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:46:28,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i [2025-03-08 22:46:28,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287175c16/404872ef4c0d40b7ae489dfbb8921d40/FLAGcee138016 [2025-03-08 22:46:28,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287175c16/404872ef4c0d40b7ae489dfbb8921d40 [2025-03-08 22:46:28,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:46:28,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:46:28,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:46:28,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:46:28,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:46:28,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129e3707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28, skipping insertion in model container [2025-03-08 22:46:28,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:46:28,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:46:28,668 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:46:28,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:46:28,741 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:46:28,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28 WrapperNode [2025-03-08 22:46:28,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:46:28,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:46:28,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:46:28,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:46:28,747 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:46:28" (1/1) ... [2025-03-08 22:46:28,756 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:46:28" (1/1) ... [2025-03-08 22:46:28,775 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 247 [2025-03-08 22:46:28,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:46:28,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:46:28,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:46:28,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:46:28,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,825 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2025-03-08 22:46:28,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:46:28,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:46:28,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:46:28,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:46:28,852 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (1/1) ... [2025-03-08 22:46:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:46:28,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:28,883 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:46:28,886 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:46:28,903 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-03-08 22:46:28,904 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-03-08 22:46:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:46:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:46:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:46:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:46:28,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:46:28,996 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:46:28,998 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:46:29,359 INFO L? ?]: Removed 186 outVars from TransFormulas that were not future-live. [2025-03-08 22:46:29,359 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:46:29,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:46:29,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:46:29,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:29 BoogieIcfgContainer [2025-03-08 22:46:29,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:46:29,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:46:29,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:46:29,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:46:29,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:46:28" (1/3) ... [2025-03-08 22:46:29,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184ea615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:29, skipping insertion in model container [2025-03-08 22:46:29,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:28" (2/3) ... [2025-03-08 22:46:29,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184ea615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:29, skipping insertion in model container [2025-03-08 22:46:29,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:29" (3/3) ... [2025-03-08 22:46:29,382 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0217_1.i [2025-03-08 22:46:29,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:46:29,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0217_1.i that has 2 procedures, 169 locations, 1 initial locations, 6 loop locations, and 67 error locations. [2025-03-08 22:46:29,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:46:29,430 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;@26dcf1c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:46:29,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-03-08 22:46:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 98 states have (on average 1.969387755102041) internal successors, (193), 165 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:46:29,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:29,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:46:29,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:29,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1668567796, now seen corresponding path program 1 times [2025-03-08 22:46:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:29,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854533245] [2025-03-08 22:46:29,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:29,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:46:29,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:46:29,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:29,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:29,554 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:46:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:29,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854533245] [2025-03-08 22:46:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854533245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865212064] [2025-03-08 22:46:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:29,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:46:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:29,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:46:29,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:46:29,580 INFO L87 Difference]: Start difference. First operand has 169 states, 98 states have (on average 1.969387755102041) internal successors, (193), 165 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:46:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:29,594 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2025-03-08 22:46:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:46:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-08 22:46:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:29,600 INFO L225 Difference]: With dead ends: 169 [2025-03-08 22:46:29,600 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 22:46:29,601 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:46:29,602 INFO L435 NwaCegarLoop]: 191 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, 191 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:46:29,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 22:46:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-08 22:46:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 97 states have (on average 1.907216494845361) internal successors, (185), 163 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2025-03-08 22:46:29,632 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 6 [2025-03-08 22:46:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2025-03-08 22:46:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:46:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2025-03-08 22:46:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:46:29,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:29,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:46:29,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1332615762, now seen corresponding path program 1 times [2025-03-08 22:46:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828520040] [2025-03-08 22:46:29,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:46:29,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:46:29,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:29,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:29,756 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:46:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828520040] [2025-03-08 22:46:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828520040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:46:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656806429] [2025-03-08 22:46:29,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:29,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:29,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:29,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:29,758 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:46:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:29,921 INFO L93 Difference]: Finished difference Result 325 states and 368 transitions. [2025-03-08 22:46:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-08 22:46:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:29,923 INFO L225 Difference]: With dead ends: 325 [2025-03-08 22:46:29,924 INFO L226 Difference]: Without dead ends: 325 [2025-03-08 22:46:29,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:46:29,924 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 169 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:29,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 245 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-08 22:46:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 234. [2025-03-08 22:46:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 161 states have (on average 1.8819875776397517) internal successors, (303), 227 states have internal predecessors, (303), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:46:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 311 transitions. [2025-03-08 22:46:29,935 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 311 transitions. Word has length 8 [2025-03-08 22:46:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:29,935 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 311 transitions. [2025-03-08 22:46:29,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:46:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 311 transitions. [2025-03-08 22:46:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:46:29,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:29,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:29,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:46:29,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:29,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1332615761, now seen corresponding path program 1 times [2025-03-08 22:46:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757453460] [2025-03-08 22:46:29,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:29,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:46:29,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:46:29,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:29,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:30,054 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:46:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757453460] [2025-03-08 22:46:30,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757453460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:30,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:30,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573858583] [2025-03-08 22:46:30,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:30,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:30,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:30,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:30,058 INFO L87 Difference]: Start difference. First operand 234 states and 311 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:46:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:30,196 INFO L93 Difference]: Finished difference Result 365 states and 471 transitions. [2025-03-08 22:46:30,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:30,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-08 22:46:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:30,198 INFO L225 Difference]: With dead ends: 365 [2025-03-08 22:46:30,198 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 22:46:30,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:46:30,199 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 107 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:30,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 415 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 22:46:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2025-03-08 22:46:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 236 states have (on average 1.8389830508474576) internal successors, (434), 304 states have internal predecessors, (434), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 450 transitions. [2025-03-08 22:46:30,225 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 450 transitions. Word has length 8 [2025-03-08 22:46:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:30,226 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 450 transitions. [2025-03-08 22:46:30,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:46:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 450 transitions. [2025-03-08 22:46:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:46:30,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:30,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:46:30,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:30,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1332615730, now seen corresponding path program 1 times [2025-03-08 22:46:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024607483] [2025-03-08 22:46:30,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:30,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:46:30,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:46:30,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:30,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:30,335 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:46:30,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:30,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024607483] [2025-03-08 22:46:30,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024607483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:30,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557132335] [2025-03-08 22:46:30,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:30,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:30,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:30,338 INFO L87 Difference]: Start difference. First operand 315 states and 450 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:46:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:30,475 INFO L93 Difference]: Finished difference Result 364 states and 469 transitions. [2025-03-08 22:46:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-08 22:46:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:30,477 INFO L225 Difference]: With dead ends: 364 [2025-03-08 22:46:30,477 INFO L226 Difference]: Without dead ends: 364 [2025-03-08 22:46:30,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:46:30,478 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 105 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:30,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 416 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-08 22:46:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 315. [2025-03-08 22:46:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 236 states have (on average 1.8389830508474576) internal successors, (434), 304 states have internal predecessors, (434), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 450 transitions. [2025-03-08 22:46:30,495 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 450 transitions. Word has length 8 [2025-03-08 22:46:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:30,496 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 450 transitions. [2025-03-08 22:46:30,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:46:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 450 transitions. [2025-03-08 22:46:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:46:30,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:30,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:30,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:46:30,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1573460764, now seen corresponding path program 1 times [2025-03-08 22:46:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070173191] [2025-03-08 22:46:30,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:30,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:46:30,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:46:30,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:30,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:30,529 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:46:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:30,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070173191] [2025-03-08 22:46:30,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070173191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:30,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:30,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:30,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045606581] [2025-03-08 22:46:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:30,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:30,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:30,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:30,531 INFO L87 Difference]: Start difference. First operand 315 states and 450 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:46:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:30,546 INFO L93 Difference]: Finished difference Result 453 states and 604 transitions. [2025-03-08 22:46:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:46:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:30,547 INFO L225 Difference]: With dead ends: 453 [2025-03-08 22:46:30,547 INFO L226 Difference]: Without dead ends: 453 [2025-03-08 22:46:30,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:30,548 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 158 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-08 22:46:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 317. [2025-03-08 22:46:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 238 states have (on average 1.8235294117647058) internal successors, (434), 306 states have internal predecessors, (434), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 450 transitions. [2025-03-08 22:46:30,558 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 450 transitions. Word has length 11 [2025-03-08 22:46:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:30,559 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 450 transitions. [2025-03-08 22:46:30,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:46:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 450 transitions. [2025-03-08 22:46:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:46:30,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:30,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:30,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:46:30,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:30,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1573461117, now seen corresponding path program 1 times [2025-03-08 22:46:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172498774] [2025-03-08 22:46:30,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:30,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:46:30,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:46:30,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:30,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:30,587 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:46:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172498774] [2025-03-08 22:46:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172498774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:30,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:30,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464059464] [2025-03-08 22:46:30,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:30,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:30,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:30,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:30,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:30,589 INFO L87 Difference]: Start difference. First operand 317 states and 450 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:46:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:30,683 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2025-03-08 22:46:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:46:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:30,686 INFO L225 Difference]: With dead ends: 367 [2025-03-08 22:46:30,686 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 22:46:30,686 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:46:30,686 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 71 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:30,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 283 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 22:46:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 314. [2025-03-08 22:46:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 235 states have (on average 1.825531914893617) internal successors, (429), 303 states have internal predecessors, (429), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 445 transitions. [2025-03-08 22:46:30,696 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 445 transitions. Word has length 11 [2025-03-08 22:46:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:30,696 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 445 transitions. [2025-03-08 22:46:30,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:46:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 445 transitions. [2025-03-08 22:46:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:46:30,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:30,697 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:46:30,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:46:30,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:30,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1830100376, now seen corresponding path program 1 times [2025-03-08 22:46:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:30,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938503208] [2025-03-08 22:46:30,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:30,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:46:30,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:46:30,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:30,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:30,767 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:46:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938503208] [2025-03-08 22:46:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938503208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:30,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683109964] [2025-03-08 22:46:30,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:30,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:30,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:30,768 INFO L87 Difference]: Start difference. First operand 314 states and 445 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:30,942 INFO L93 Difference]: Finished difference Result 421 states and 539 transitions. [2025-03-08 22:46:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 22:46:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:30,944 INFO L225 Difference]: With dead ends: 421 [2025-03-08 22:46:30,944 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 22:46:30,944 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:46:30,944 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 171 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:30,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 355 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 22:46:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 320. [2025-03-08 22:46:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 241 states have (on average 1.8049792531120332) internal successors, (435), 309 states have internal predecessors, (435), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 451 transitions. [2025-03-08 22:46:30,969 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 451 transitions. Word has length 17 [2025-03-08 22:46:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:30,969 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 451 transitions. [2025-03-08 22:46:30,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 451 transitions. [2025-03-08 22:46:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:46:30,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:30,970 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:46:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:46:30,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1830100375, now seen corresponding path program 1 times [2025-03-08 22:46:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074349266] [2025-03-08 22:46:30,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:30,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:46:30,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:46:30,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:31,050 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:46:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:31,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074349266] [2025-03-08 22:46:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074349266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:31,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897490648] [2025-03-08 22:46:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:31,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:31,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:31,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:31,052 INFO L87 Difference]: Start difference. First operand 320 states and 451 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:31,181 INFO L93 Difference]: Finished difference Result 353 states and 450 transitions. [2025-03-08 22:46:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:31,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 22:46:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:31,183 INFO L225 Difference]: With dead ends: 353 [2025-03-08 22:46:31,183 INFO L226 Difference]: Without dead ends: 353 [2025-03-08 22:46:31,183 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:46:31,183 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 93 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:31,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 427 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-08 22:46:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 320. [2025-03-08 22:46:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 241 states have (on average 1.7800829875518671) internal successors, (429), 309 states have internal predecessors, (429), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 445 transitions. [2025-03-08 22:46:31,195 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 445 transitions. Word has length 17 [2025-03-08 22:46:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 445 transitions. [2025-03-08 22:46:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 445 transitions. [2025-03-08 22:46:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:46:31,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:31,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:31,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:46:31,197 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:31,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2024360622, now seen corresponding path program 1 times [2025-03-08 22:46:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590455445] [2025-03-08 22:46:31,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:31,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:46:31,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:46:31,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:31,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:31,316 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:46:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590455445] [2025-03-08 22:46:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590455445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841465233] [2025-03-08 22:46:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:31,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:31,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:31,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:31,318 INFO L87 Difference]: Start difference. First operand 320 states and 445 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:31,519 INFO L93 Difference]: Finished difference Result 435 states and 560 transitions. [2025-03-08 22:46:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:31,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 22:46:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:31,521 INFO L225 Difference]: With dead ends: 435 [2025-03-08 22:46:31,521 INFO L226 Difference]: Without dead ends: 435 [2025-03-08 22:46:31,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:31,522 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 326 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:31,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 339 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-08 22:46:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 317. [2025-03-08 22:46:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 242 states have (on average 1.7479338842975207) internal successors, (423), 306 states have internal predecessors, (423), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 439 transitions. [2025-03-08 22:46:31,535 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 439 transitions. Word has length 18 [2025-03-08 22:46:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:31,536 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 439 transitions. [2025-03-08 22:46:31,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 439 transitions. [2025-03-08 22:46:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:46:31,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:31,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:31,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:46:31,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:31,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2024360621, now seen corresponding path program 1 times [2025-03-08 22:46:31,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:31,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612757495] [2025-03-08 22:46:31,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:31,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:46:31,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:46:31,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:31,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:31,680 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:46:31,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:31,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612757495] [2025-03-08 22:46:31,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612757495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:31,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:31,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461151940] [2025-03-08 22:46:31,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:31,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:31,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:31,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:31,681 INFO L87 Difference]: Start difference. First operand 317 states and 439 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:31,985 INFO L93 Difference]: Finished difference Result 446 states and 562 transitions. [2025-03-08 22:46:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:31,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 22:46:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:31,987 INFO L225 Difference]: With dead ends: 446 [2025-03-08 22:46:31,987 INFO L226 Difference]: Without dead ends: 446 [2025-03-08 22:46:31,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:31,987 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 234 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:31,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 478 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-08 22:46:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 337. [2025-03-08 22:46:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 262 states have (on average 1.748091603053435) internal successors, (458), 326 states have internal predecessors, (458), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:46:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2025-03-08 22:46:31,998 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 18 [2025-03-08 22:46:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:31,998 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2025-03-08 22:46:31,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2025-03-08 22:46:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:46:32,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:32,000 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:46:32,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:46:32,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:32,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:32,001 INFO L85 PathProgramCache]: Analyzing trace with hash -407214163, now seen corresponding path program 1 times [2025-03-08 22:46:32,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:32,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482993532] [2025-03-08 22:46:32,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:32,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:46:32,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:46:32,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:32,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:32,237 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:46:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482993532] [2025-03-08 22:46:32,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482993532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:32,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:32,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:46:32,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533680649] [2025-03-08 22:46:32,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:32,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:46:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:32,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:46:32,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:32,238 INFO L87 Difference]: Start difference. First operand 337 states and 474 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:32,429 INFO L93 Difference]: Finished difference Result 448 states and 602 transitions. [2025-03-08 22:46:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:46:32,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-08 22:46:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:32,431 INFO L225 Difference]: With dead ends: 448 [2025-03-08 22:46:32,431 INFO L226 Difference]: Without dead ends: 448 [2025-03-08 22:46:32,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:46:32,432 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 108 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:32,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1134 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-08 22:46:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 398. [2025-03-08 22:46:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 320 states have (on average 1.709375) internal successors, (547), 383 states have internal predecessors, (547), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:46:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 567 transitions. [2025-03-08 22:46:32,439 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 567 transitions. Word has length 22 [2025-03-08 22:46:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:32,439 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 567 transitions. [2025-03-08 22:46:32,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 567 transitions. [2025-03-08 22:46:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:46:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:32,440 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:46:32,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:46:32,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:32,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1777294561, now seen corresponding path program 1 times [2025-03-08 22:46:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432823353] [2025-03-08 22:46:32,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:32,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:46:32,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:46:32,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:32,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:32,647 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:46:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432823353] [2025-03-08 22:46:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432823353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:46:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377579300] [2025-03-08 22:46:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:46:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:46:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:32,648 INFO L87 Difference]: Start difference. First operand 398 states and 567 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:32,933 INFO L93 Difference]: Finished difference Result 440 states and 591 transitions. [2025-03-08 22:46:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:46:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-08 22:46:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:32,936 INFO L225 Difference]: With dead ends: 440 [2025-03-08 22:46:32,936 INFO L226 Difference]: Without dead ends: 440 [2025-03-08 22:46:32,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:32,936 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 97 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:32,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1106 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-08 22:46:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 392. [2025-03-08 22:46:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 314 states have (on average 1.7070063694267517) internal successors, (536), 377 states have internal predecessors, (536), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:46:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 556 transitions. [2025-03-08 22:46:32,944 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 556 transitions. Word has length 23 [2025-03-08 22:46:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:32,944 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 556 transitions. [2025-03-08 22:46:32,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 556 transitions. [2025-03-08 22:46:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:46:32,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:32,945 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:46:32,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:46:32,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:32,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash -490019804, now seen corresponding path program 1 times [2025-03-08 22:46:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177181194] [2025-03-08 22:46:32,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:32,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:46:32,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:46:32,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:32,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:32,972 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:46:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177181194] [2025-03-08 22:46:32,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177181194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:32,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059711061] [2025-03-08 22:46:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:32,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:32,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:32,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:32,973 INFO L87 Difference]: Start difference. First operand 392 states and 556 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:33,030 INFO L93 Difference]: Finished difference Result 389 states and 547 transitions. [2025-03-08 22:46:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:33,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-08 22:46:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:33,032 INFO L225 Difference]: With dead ends: 389 [2025-03-08 22:46:33,032 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 22:46:33,032 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:46:33,032 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 29 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:33,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 255 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 22:46:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-03-08 22:46:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 314 states have (on average 1.678343949044586) internal successors, (527), 374 states have internal predecessors, (527), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:46:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 547 transitions. [2025-03-08 22:46:33,039 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 547 transitions. Word has length 24 [2025-03-08 22:46:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:33,039 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 547 transitions. [2025-03-08 22:46:33,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 547 transitions. [2025-03-08 22:46:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:46:33,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:33,040 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:46:33,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:46:33,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:33,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -490019803, now seen corresponding path program 1 times [2025-03-08 22:46:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:33,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466719217] [2025-03-08 22:46:33,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:33,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:46:33,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:46:33,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:33,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:33,107 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:46:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466719217] [2025-03-08 22:46:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466719217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559930045] [2025-03-08 22:46:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:33,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:33,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:33,109 INFO L87 Difference]: Start difference. First operand 389 states and 547 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:33,190 INFO L93 Difference]: Finished difference Result 444 states and 620 transitions. [2025-03-08 22:46:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-08 22:46:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:33,192 INFO L225 Difference]: With dead ends: 444 [2025-03-08 22:46:33,192 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 22:46:33,192 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:46:33,192 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:33,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 280 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 22:46:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 438. [2025-03-08 22:46:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 364 states have (on average 1.6483516483516483) internal successors, (600), 423 states have internal predecessors, (600), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:46:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 620 transitions. [2025-03-08 22:46:33,200 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 620 transitions. Word has length 24 [2025-03-08 22:46:33,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:33,200 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 620 transitions. [2025-03-08 22:46:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 620 transitions. [2025-03-08 22:46:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:46:33,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:33,201 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:46:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:46:33,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:33,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1416139395, now seen corresponding path program 1 times [2025-03-08 22:46:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:33,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865615831] [2025-03-08 22:46:33,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:33,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:46:33,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:46:33,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:33,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:33,241 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:46:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865615831] [2025-03-08 22:46:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865615831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993767019] [2025-03-08 22:46:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:33,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:33,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:33,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:33,242 INFO L87 Difference]: Start difference. First operand 438 states and 620 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:33,401 INFO L93 Difference]: Finished difference Result 526 states and 698 transitions. [2025-03-08 22:46:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:33,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 22:46:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:33,403 INFO L225 Difference]: With dead ends: 526 [2025-03-08 22:46:33,403 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 22:46:33,403 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:46:33,403 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 175 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:33,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 360 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 22:46:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 458. [2025-03-08 22:46:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 384 states have (on average 1.6666666666666667) internal successors, (640), 443 states have internal predecessors, (640), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:46:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 660 transitions. [2025-03-08 22:46:33,411 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 660 transitions. Word has length 25 [2025-03-08 22:46:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:33,411 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 660 transitions. [2025-03-08 22:46:33,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 660 transitions. [2025-03-08 22:46:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:46:33,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:33,412 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:46:33,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:46:33,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1416139394, now seen corresponding path program 1 times [2025-03-08 22:46:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032346339] [2025-03-08 22:46:33,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:33,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:46:33,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:46:33,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:33,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:33,533 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:46:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:33,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032346339] [2025-03-08 22:46:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032346339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:46:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368578721] [2025-03-08 22:46:33,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:33,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:46:33,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:33,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:46:33,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:33,535 INFO L87 Difference]: Start difference. First operand 458 states and 660 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:33,679 INFO L93 Difference]: Finished difference Result 353 states and 476 transitions. [2025-03-08 22:46:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:46:33,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 22:46:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:33,681 INFO L225 Difference]: With dead ends: 353 [2025-03-08 22:46:33,681 INFO L226 Difference]: Without dead ends: 353 [2025-03-08 22:46:33,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:33,681 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 43 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:33,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1126 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-08 22:46:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2025-03-08 22:46:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 276 states have (on average 1.6485507246376812) internal successors, (455), 334 states have internal predecessors, (455), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 467 transitions. [2025-03-08 22:46:33,691 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 467 transitions. Word has length 25 [2025-03-08 22:46:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:33,692 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 467 transitions. [2025-03-08 22:46:33,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 467 transitions. [2025-03-08 22:46:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:46:33,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:33,692 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:46:33,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:46:33,692 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:33,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1582336972, now seen corresponding path program 1 times [2025-03-08 22:46:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415830607] [2025-03-08 22:46:33,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:33,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:46:33,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:46:33,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:33,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:33,746 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:46:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415830607] [2025-03-08 22:46:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415830607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:46:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419831057] [2025-03-08 22:46:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:33,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:33,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:33,749 INFO L87 Difference]: Start difference. First operand 344 states and 467 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:33,767 INFO L93 Difference]: Finished difference Result 294 states and 385 transitions. [2025-03-08 22:46:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:33,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 22:46:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:33,769 INFO L225 Difference]: With dead ends: 294 [2025-03-08 22:46:33,769 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 22:46:33,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:33,770 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 45 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:33,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 818 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 22:46:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-08 22:46:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 227 states have (on average 1.6431718061674008) internal successors, (373), 284 states have internal predecessors, (373), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2025-03-08 22:46:33,776 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 25 [2025-03-08 22:46:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:33,776 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2025-03-08 22:46:33,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2025-03-08 22:46:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:46:33,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:33,777 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:46:33,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:46:33,777 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:33,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1537374622, now seen corresponding path program 1 times [2025-03-08 22:46:33,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:33,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444929672] [2025-03-08 22:46:33,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:33,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:46:33,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:46:33,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:33,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:33,852 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:46:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444929672] [2025-03-08 22:46:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444929672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:33,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76728463] [2025-03-08 22:46:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:33,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:33,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:33,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:33,853 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:33,920 INFO L93 Difference]: Finished difference Result 293 states and 382 transitions. [2025-03-08 22:46:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:33,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-08 22:46:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:33,922 INFO L225 Difference]: With dead ends: 293 [2025-03-08 22:46:33,922 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 22:46:33,922 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:46:33,922 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 24 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:33,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 555 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 22:46:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-08 22:46:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 227 states have (on average 1.6299559471365639) internal successors, (370), 283 states have internal predecessors, (370), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 382 transitions. [2025-03-08 22:46:33,927 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 382 transitions. Word has length 26 [2025-03-08 22:46:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:33,927 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 382 transitions. [2025-03-08 22:46:33,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 382 transitions. [2025-03-08 22:46:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:46:33,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:33,927 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:46:33,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:46:33,928 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:33,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1537374656, now seen corresponding path program 1 times [2025-03-08 22:46:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:33,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837672939] [2025-03-08 22:46:33,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:33,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:33,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:46:33,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:46:33,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:33,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:34,008 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:46:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837672939] [2025-03-08 22:46:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837672939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:46:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654154930] [2025-03-08 22:46:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:34,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:34,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:34,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:34,009 INFO L87 Difference]: Start difference. First operand 293 states and 382 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:34,110 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2025-03-08 22:46:34,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:46:34,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-08 22:46:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:34,112 INFO L225 Difference]: With dead ends: 323 [2025-03-08 22:46:34,112 INFO L226 Difference]: Without dead ends: 323 [2025-03-08 22:46:34,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:46:34,112 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 12 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:34,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 750 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-08 22:46:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2025-03-08 22:46:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 254 states have (on average 1.5708661417322836) internal successors, (399), 310 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 411 transitions. [2025-03-08 22:46:34,117 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 411 transitions. Word has length 26 [2025-03-08 22:46:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 411 transitions. [2025-03-08 22:46:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 411 transitions. [2025-03-08 22:46:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 22:46:34,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:34,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:34,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:46:34,118 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 483348917, now seen corresponding path program 1 times [2025-03-08 22:46:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802043629] [2025-03-08 22:46:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:34,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:46:34,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:46:34,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:34,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:34,176 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:46:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802043629] [2025-03-08 22:46:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802043629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:34,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178537212] [2025-03-08 22:46:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:34,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:34,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:34,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:34,177 INFO L87 Difference]: Start difference. First operand 320 states and 411 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:34,303 INFO L93 Difference]: Finished difference Result 321 states and 411 transitions. [2025-03-08 22:46:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-08 22:46:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:34,304 INFO L225 Difference]: With dead ends: 321 [2025-03-08 22:46:34,304 INFO L226 Difference]: Without dead ends: 321 [2025-03-08 22:46:34,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:34,304 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 49 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:34,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 557 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-08 22:46:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-03-08 22:46:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 254 states have (on average 1.562992125984252) internal successors, (397), 309 states have internal predecessors, (397), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 409 transitions. [2025-03-08 22:46:34,318 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 409 transitions. Word has length 34 [2025-03-08 22:46:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:34,319 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 409 transitions. [2025-03-08 22:46:34,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 409 transitions. [2025-03-08 22:46:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 22:46:34,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:34,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, 1] [2025-03-08 22:46:34,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:46:34,319 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:34,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:34,320 INFO L85 PathProgramCache]: Analyzing trace with hash 483348918, now seen corresponding path program 1 times [2025-03-08 22:46:34,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:34,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715956521] [2025-03-08 22:46:34,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:34,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:46:34,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:46:34,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:34,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:34,434 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:46:34,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715956521] [2025-03-08 22:46:34,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715956521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:34,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:34,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:34,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796509002] [2025-03-08 22:46:34,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:34,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:34,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:34,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:34,435 INFO L87 Difference]: Start difference. First operand 319 states and 409 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:34,552 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2025-03-08 22:46:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:34,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-08 22:46:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:34,554 INFO L225 Difference]: With dead ends: 320 [2025-03-08 22:46:34,554 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 22:46:34,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:34,554 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 39 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:34,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 585 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 22:46:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2025-03-08 22:46:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.5551181102362204) internal successors, (395), 308 states have internal predecessors, (395), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 407 transitions. [2025-03-08 22:46:34,562 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 407 transitions. Word has length 34 [2025-03-08 22:46:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:34,562 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 407 transitions. [2025-03-08 22:46:34,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 407 transitions. [2025-03-08 22:46:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:46:34,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:34,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:46:34,562 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 641844082, now seen corresponding path program 1 times [2025-03-08 22:46:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:34,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768544501] [2025-03-08 22:46:34,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:34,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:46:34,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:46:34,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:34,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:34,628 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:46:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768544501] [2025-03-08 22:46:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768544501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144403849] [2025-03-08 22:46:34,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:34,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:34,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:34,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:34,630 INFO L87 Difference]: Start difference. First operand 318 states and 407 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:34,720 INFO L93 Difference]: Finished difference Result 356 states and 451 transitions. [2025-03-08 22:46:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-08 22:46:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:34,721 INFO L225 Difference]: With dead ends: 356 [2025-03-08 22:46:34,721 INFO L226 Difference]: Without dead ends: 356 [2025-03-08 22:46:34,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:34,722 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 78 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:34,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 369 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-08 22:46:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 315. [2025-03-08 22:46:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 254 states have (on average 1.531496062992126) internal successors, (389), 305 states have internal predecessors, (389), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 401 transitions. [2025-03-08 22:46:34,729 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 401 transitions. Word has length 36 [2025-03-08 22:46:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:34,729 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 401 transitions. [2025-03-08 22:46:34,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 401 transitions. [2025-03-08 22:46:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:46:34,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:34,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:46:34,730 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:34,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 641844083, now seen corresponding path program 1 times [2025-03-08 22:46:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049516235] [2025-03-08 22:46:34,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:34,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:46:34,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:46:34,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:34,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:34,902 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:46:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049516235] [2025-03-08 22:46:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049516235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:34,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:34,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:46:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392685935] [2025-03-08 22:46:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:34,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:46:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:34,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:46:34,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:34,903 INFO L87 Difference]: Start difference. First operand 315 states and 401 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:35,080 INFO L93 Difference]: Finished difference Result 355 states and 449 transitions. [2025-03-08 22:46:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:46:35,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-08 22:46:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:35,082 INFO L225 Difference]: With dead ends: 355 [2025-03-08 22:46:35,082 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 22:46:35,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:46:35,082 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 301 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 638 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:46:35,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 638 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 22:46:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 314. [2025-03-08 22:46:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 254 states have (on average 1.5236220472440944) internal successors, (387), 304 states have internal predecessors, (387), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 399 transitions. [2025-03-08 22:46:35,087 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 399 transitions. Word has length 36 [2025-03-08 22:46:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:35,088 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 399 transitions. [2025-03-08 22:46:35,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 399 transitions. [2025-03-08 22:46:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:46:35,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:35,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:35,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:46:35,089 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:35,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash 641844111, now seen corresponding path program 1 times [2025-03-08 22:46:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637236803] [2025-03-08 22:46:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:35,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:46:35,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:46:35,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:35,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:35,269 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:46:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:35,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637236803] [2025-03-08 22:46:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637236803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:35,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:35,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:35,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074558324] [2025-03-08 22:46:35,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:35,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:35,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:35,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:35,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:35,270 INFO L87 Difference]: Start difference. First operand 314 states and 399 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:35,464 INFO L93 Difference]: Finished difference Result 367 states and 424 transitions. [2025-03-08 22:46:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:35,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-08 22:46:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:35,466 INFO L225 Difference]: With dead ends: 367 [2025-03-08 22:46:35,466 INFO L226 Difference]: Without dead ends: 367 [2025-03-08 22:46:35,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:35,466 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 191 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:35,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 304 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-08 22:46:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 314. [2025-03-08 22:46:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 254 states have (on average 1.515748031496063) internal successors, (385), 304 states have internal predecessors, (385), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 397 transitions. [2025-03-08 22:46:35,471 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 397 transitions. Word has length 36 [2025-03-08 22:46:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:35,472 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 397 transitions. [2025-03-08 22:46:35,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 397 transitions. [2025-03-08 22:46:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:46:35,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:35,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:46:35,472 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:35,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash -293329686, now seen corresponding path program 1 times [2025-03-08 22:46:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:35,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292085292] [2025-03-08 22:46:35,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:35,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:46:35,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:46:35,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:35,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:35,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:35,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292085292] [2025-03-08 22:46:35,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292085292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725044369] [2025-03-08 22:46:35,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:35,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:35,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:35,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:35,638 INFO L87 Difference]: Start difference. First operand 314 states and 397 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:35,771 INFO L93 Difference]: Finished difference Result 315 states and 396 transitions. [2025-03-08 22:46:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-08 22:46:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:35,772 INFO L225 Difference]: With dead ends: 315 [2025-03-08 22:46:35,772 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 22:46:35,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:35,773 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 242 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:35,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 340 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 22:46:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2025-03-08 22:46:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 254 states have (on average 1.4960629921259843) internal successors, (380), 301 states have internal predecessors, (380), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 392 transitions. [2025-03-08 22:46:35,778 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 392 transitions. Word has length 50 [2025-03-08 22:46:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:35,778 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 392 transitions. [2025-03-08 22:46:35,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 392 transitions. [2025-03-08 22:46:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:46:35,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:35,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:46:35,779 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:35,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:35,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1156232507, now seen corresponding path program 1 times [2025-03-08 22:46:35,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:35,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657032265] [2025-03-08 22:46:35,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:35,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:35,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:46:35,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:46:35,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:35,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657032265] [2025-03-08 22:46:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657032265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:35,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:35,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333352382] [2025-03-08 22:46:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:35,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:35,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:35,906 INFO L87 Difference]: Start difference. First operand 311 states and 392 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:36,017 INFO L93 Difference]: Finished difference Result 316 states and 397 transitions. [2025-03-08 22:46:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-08 22:46:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:36,022 INFO L225 Difference]: With dead ends: 316 [2025-03-08 22:46:36,022 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 22:46:36,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:36,022 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 256 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:36,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 308 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 22:46:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2025-03-08 22:46:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 256 states have (on average 1.49609375) internal successors, (383), 303 states have internal predecessors, (383), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 395 transitions. [2025-03-08 22:46:36,028 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 395 transitions. Word has length 51 [2025-03-08 22:46:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:36,029 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 395 transitions. [2025-03-08 22:46:36,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 395 transitions. [2025-03-08 22:46:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:46:36,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:36,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:36,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:46:36,029 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1156232538, now seen corresponding path program 1 times [2025-03-08 22:46:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327341135] [2025-03-08 22:46:36,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:36,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:46:36,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:46:36,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:36,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327341135] [2025-03-08 22:46:36,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327341135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081554888] [2025-03-08 22:46:36,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:36,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:36,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:36,221 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:46:36,222 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:46:36,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:46:36,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:46:36,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:36,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:36,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:46:36,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:36,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081554888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 12 [2025-03-08 22:46:36,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644294802] [2025-03-08 22:46:36,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:36,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:36,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:36,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:36,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:36,656 INFO L87 Difference]: Start difference. First operand 313 states and 395 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:36,777 INFO L93 Difference]: Finished difference Result 315 states and 395 transitions. [2025-03-08 22:46:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:36,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-08 22:46:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:36,778 INFO L225 Difference]: With dead ends: 315 [2025-03-08 22:46:36,778 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 22:46:36,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:46:36,779 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 219 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:36,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 357 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 22:46:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 310. [2025-03-08 22:46:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 254 states have (on average 1.4881889763779528) internal successors, (378), 300 states have internal predecessors, (378), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 390 transitions. [2025-03-08 22:46:36,785 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 390 transitions. Word has length 51 [2025-03-08 22:46:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:36,785 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 390 transitions. [2025-03-08 22:46:36,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 390 transitions. [2025-03-08 22:46:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:46:36,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:36,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:36,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:36,990 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,SelfDestructingSolverStorable26 [2025-03-08 22:46:36,990 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:36,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2085746668, now seen corresponding path program 1 times [2025-03-08 22:46:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182690385] [2025-03-08 22:46:36,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:37,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:46:37,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:46:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:46:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182690385] [2025-03-08 22:46:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182690385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:37,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:46:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450953051] [2025-03-08 22:46:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:37,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:37,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:37,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:37,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:37,078 INFO L87 Difference]: Start difference. First operand 310 states and 390 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:46:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:37,095 INFO L93 Difference]: Finished difference Result 311 states and 390 transitions. [2025-03-08 22:46:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-08 22:46:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:37,097 INFO L225 Difference]: With dead ends: 311 [2025-03-08 22:46:37,097 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 22:46:37,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:37,098 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 134 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:37,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 22:46:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2025-03-08 22:46:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 254 states have (on average 1.4803149606299213) internal successors, (376), 299 states have internal predecessors, (376), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 388 transitions. [2025-03-08 22:46:37,103 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 388 transitions. Word has length 55 [2025-03-08 22:46:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:37,104 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 388 transitions. [2025-03-08 22:46:37,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:46:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 388 transitions. [2025-03-08 22:46:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:46:37,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:37,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:46:37,104 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:37,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash -315139624, now seen corresponding path program 1 times [2025-03-08 22:46:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145894783] [2025-03-08 22:46:37,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:37,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:46:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:46:37,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:37,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:38,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145894783] [2025-03-08 22:46:38,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145894783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:38,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:38,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:46:38,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033891032] [2025-03-08 22:46:38,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:38,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:46:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:38,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:46:38,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:38,066 INFO L87 Difference]: Start difference. First operand 309 states and 388 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:38,606 INFO L93 Difference]: Finished difference Result 328 states and 408 transitions. [2025-03-08 22:46:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:46:38,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-08 22:46:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:38,607 INFO L225 Difference]: With dead ends: 328 [2025-03-08 22:46:38,607 INFO L226 Difference]: Without dead ends: 328 [2025-03-08 22:46:38,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:46:38,608 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 50 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:38,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 842 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-08 22:46:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2025-03-08 22:46:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 272 states have (on average 1.4522058823529411) internal successors, (395), 317 states have internal predecessors, (395), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:46:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 407 transitions. [2025-03-08 22:46:38,613 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 407 transitions. Word has length 54 [2025-03-08 22:46:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:38,613 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 407 transitions. [2025-03-08 22:46:38,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 407 transitions. [2025-03-08 22:46:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:46:38,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:38,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:38,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:46:38,614 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:38,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash 358836048, now seen corresponding path program 1 times [2025-03-08 22:46:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896093561] [2025-03-08 22:46:38,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:38,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:46:38,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:46:38,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:38,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:39,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896093561] [2025-03-08 22:46:39,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896093561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:39,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168904728] [2025-03-08 22:46:39,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:39,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:39,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:39,485 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:46:39,487 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:46:39,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:46:39,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:46:39,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:39,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:39,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 22:46:39,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:39,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:46:40,021 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:46:40,029 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:46:40,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-08 22:46:40,186 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 11 [2025-03-08 22:46:40,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-08 22:46:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:40,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168904728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2025-03-08 22:46:40,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145432187] [2025-03-08 22:46:40,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:40,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:46:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:40,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:46:40,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:46:40,356 INFO L87 Difference]: Start difference. First operand 327 states and 407 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:40,967 INFO L93 Difference]: Finished difference Result 604 states and 762 transitions. [2025-03-08 22:46:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:46:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-08 22:46:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:40,969 INFO L225 Difference]: With dead ends: 604 [2025-03-08 22:46:40,969 INFO L226 Difference]: Without dead ends: 604 [2025-03-08 22:46:40,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:46:40,970 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 325 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:40,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1599 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:46:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-08 22:46:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 459. [2025-03-08 22:46:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 398 states have (on average 1.4748743718592965) internal successors, (587), 445 states have internal predecessors, (587), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:46:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 607 transitions. [2025-03-08 22:46:40,980 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 607 transitions. Word has length 55 [2025-03-08 22:46:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:40,980 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 607 transitions. [2025-03-08 22:46:40,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 607 transitions. [2025-03-08 22:46:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:46:40,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:40,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,989 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:46:41,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:41,186 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 358836047, now seen corresponding path program 1 times [2025-03-08 22:46:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706421789] [2025-03-08 22:46:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:41,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:46:41,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:46:41,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:41,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706421789] [2025-03-08 22:46:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706421789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:41,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:46:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057421299] [2025-03-08 22:46:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:41,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:46:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:41,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:46:41,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:46:41,635 INFO L87 Difference]: Start difference. First operand 459 states and 607 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:42,040 INFO L93 Difference]: Finished difference Result 723 states and 953 transitions. [2025-03-08 22:46:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:46:42,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-08 22:46:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:42,043 INFO L225 Difference]: With dead ends: 723 [2025-03-08 22:46:42,043 INFO L226 Difference]: Without dead ends: 723 [2025-03-08 22:46:42,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:46:42,043 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 371 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:42,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1233 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-08 22:46:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 553. [2025-03-08 22:46:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 484 states have (on average 1.46900826446281) internal successors, (711), 533 states have internal predecessors, (711), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 22:46:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 743 transitions. [2025-03-08 22:46:42,052 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 743 transitions. Word has length 55 [2025-03-08 22:46:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:42,052 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 743 transitions. [2025-03-08 22:46:42,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 743 transitions. [2025-03-08 22:46:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:46:42,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:42,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:42,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:46:42,053 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:42,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 358835695, now seen corresponding path program 1 times [2025-03-08 22:46:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:42,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177907143] [2025-03-08 22:46:42,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:42,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:46:42,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:46:42,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:42,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177907143] [2025-03-08 22:46:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177907143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501100958] [2025-03-08 22:46:42,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:42,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:42,094 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:46:42,096 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:46:42,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:46:42,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:46:42,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:42,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:42,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:46:42,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:42,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501100958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:42,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 22:46:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027814643] [2025-03-08 22:46:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:42,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:42,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:42,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:42,252 INFO L87 Difference]: Start difference. First operand 553 states and 743 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:42,269 INFO L93 Difference]: Finished difference Result 990 states and 1345 transitions. [2025-03-08 22:46:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:46:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-08 22:46:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:42,273 INFO L225 Difference]: With dead ends: 990 [2025-03-08 22:46:42,274 INFO L226 Difference]: Without dead ends: 990 [2025-03-08 22:46:42,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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:46:42,275 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 246 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:42,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 377 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-08 22:46:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 771. [2025-03-08 22:46:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 696 states have (on average 1.5) internal successors, (1044), 745 states have internal predecessors, (1044), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 17 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 22:46:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1088 transitions. [2025-03-08 22:46:42,295 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1088 transitions. Word has length 55 [2025-03-08 22:46:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1088 transitions. [2025-03-08 22:46:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1088 transitions. [2025-03-08 22:46:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:46:42,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:42,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:42,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:42,498 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:42,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash 359759569, now seen corresponding path program 1 times [2025-03-08 22:46:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:42,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41012462] [2025-03-08 22:46:42,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:42,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:42,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:46:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:46:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:43,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41012462] [2025-03-08 22:46:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41012462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:43,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 22:46:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8283401] [2025-03-08 22:46:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:43,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:46:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:43,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:46:43,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:46:43,082 INFO L87 Difference]: Start difference. First operand 771 states and 1088 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:43,546 INFO L93 Difference]: Finished difference Result 852 states and 1157 transitions. [2025-03-08 22:46:43,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:46:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-08 22:46:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:43,549 INFO L225 Difference]: With dead ends: 852 [2025-03-08 22:46:43,549 INFO L226 Difference]: Without dead ends: 852 [2025-03-08 22:46:43,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:46:43,550 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 196 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:43,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1004 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-03-08 22:46:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 774. [2025-03-08 22:46:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 699 states have (on average 1.496423462088698) internal successors, (1046), 748 states have internal predecessors, (1046), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 17 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 22:46:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1090 transitions. [2025-03-08 22:46:43,568 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1090 transitions. Word has length 55 [2025-03-08 22:46:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:43,568 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1090 transitions. [2025-03-08 22:46:43,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1090 transitions. [2025-03-08 22:46:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:46:43,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:43,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:43,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:46:43,569 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:43,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1746181506, now seen corresponding path program 1 times [2025-03-08 22:46:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731198836] [2025-03-08 22:46:43,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:43,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:46:43,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:46:43,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:43,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731198836] [2025-03-08 22:46:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731198836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:44,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:44,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 22:46:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755379910] [2025-03-08 22:46:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:44,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:46:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:44,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:46:44,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:46:44,242 INFO L87 Difference]: Start difference. First operand 774 states and 1090 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:44,867 INFO L93 Difference]: Finished difference Result 1098 states and 1527 transitions. [2025-03-08 22:46:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:46:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-08 22:46:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:44,870 INFO L225 Difference]: With dead ends: 1098 [2025-03-08 22:46:44,870 INFO L226 Difference]: Without dead ends: 1098 [2025-03-08 22:46:44,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-08 22:46:44,871 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 344 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:44,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1775 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:46:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-03-08 22:46:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 916. [2025-03-08 22:46:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 833 states have (on average 1.5090036014405763) internal successors, (1257), 884 states have internal predecessors, (1257), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 21 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 22:46:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1313 transitions. [2025-03-08 22:46:44,888 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1313 transitions. Word has length 56 [2025-03-08 22:46:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:44,888 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1313 transitions. [2025-03-08 22:46:44,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1313 transitions. [2025-03-08 22:46:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:46:44,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:44,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:46:44,889 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:44,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1746181507, now seen corresponding path program 1 times [2025-03-08 22:46:44,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:44,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924648446] [2025-03-08 22:46:44,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:44,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:46:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:46:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924648446] [2025-03-08 22:46:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924648446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:45,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:45,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 22:46:45,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491895409] [2025-03-08 22:46:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:45,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:46:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:45,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:46:45,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:46:45,372 INFO L87 Difference]: Start difference. First operand 916 states and 1313 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:45,828 INFO L93 Difference]: Finished difference Result 1144 states and 1624 transitions. [2025-03-08 22:46:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:46:45,828 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-08 22:46:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:45,831 INFO L225 Difference]: With dead ends: 1144 [2025-03-08 22:46:45,831 INFO L226 Difference]: Without dead ends: 1144 [2025-03-08 22:46:45,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:46:45,832 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 367 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:45,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1682 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:46:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-08 22:46:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 661. [2025-03-08 22:46:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 594 states have (on average 1.5067340067340067) internal successors, (895), 641 states have internal predecessors, (895), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 22:46:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 927 transitions. [2025-03-08 22:46:45,843 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 927 transitions. Word has length 56 [2025-03-08 22:46:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 927 transitions. [2025-03-08 22:46:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 927 transitions. [2025-03-08 22:46:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:46:45,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:45,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:45,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:46:45,844 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:45,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1745257985, now seen corresponding path program 1 times [2025-03-08 22:46:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451568415] [2025-03-08 22:46:45,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:45,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:46:45,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:46:45,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:45,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:46,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:46,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451568415] [2025-03-08 22:46:46,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451568415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:46,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:46,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:46:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516429504] [2025-03-08 22:46:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:46,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:46:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:46,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:46:46,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:46:46,148 INFO L87 Difference]: Start difference. First operand 661 states and 927 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:46,465 INFO L93 Difference]: Finished difference Result 1160 states and 1650 transitions. [2025-03-08 22:46:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:46:46,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-08 22:46:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:46,468 INFO L225 Difference]: With dead ends: 1160 [2025-03-08 22:46:46,468 INFO L226 Difference]: Without dead ends: 1160 [2025-03-08 22:46:46,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:46,468 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 158 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:46,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1226 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-08 22:46:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 995. [2025-03-08 22:46:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 909 states have (on average 1.526952695269527) internal successors, (1388), 961 states have internal predecessors, (1388), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 22 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 22:46:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1448 transitions. [2025-03-08 22:46:46,483 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1448 transitions. Word has length 56 [2025-03-08 22:46:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1448 transitions. [2025-03-08 22:46:46,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1448 transitions. [2025-03-08 22:46:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:46:46,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:46,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:46,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:46:46,485 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1745257986, now seen corresponding path program 1 times [2025-03-08 22:46:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084051853] [2025-03-08 22:46:46,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:46,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:46:46,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:46:46,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:46,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:46,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084051853] [2025-03-08 22:46:46,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084051853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:46,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:46,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:46:46,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138023572] [2025-03-08 22:46:46,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:46,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:46:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:46,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:46:46,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:46:46,700 INFO L87 Difference]: Start difference. First operand 995 states and 1448 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:46,984 INFO L93 Difference]: Finished difference Result 1219 states and 1765 transitions. [2025-03-08 22:46:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:46:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-08 22:46:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:46,987 INFO L225 Difference]: With dead ends: 1219 [2025-03-08 22:46:46,987 INFO L226 Difference]: Without dead ends: 1219 [2025-03-08 22:46:46,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:46:46,988 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 165 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:46,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1101 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-03-08 22:46:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1023. [2025-03-08 22:46:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 934 states have (on average 1.525695931477516) internal successors, (1425), 987 states have internal predecessors, (1425), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 23 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 22:46:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1489 transitions. [2025-03-08 22:46:47,002 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1489 transitions. Word has length 56 [2025-03-08 22:46:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:47,002 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1489 transitions. [2025-03-08 22:46:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1489 transitions. [2025-03-08 22:46:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 22:46:47,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:47,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:47,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:46:47,003 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:47,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 193501670, now seen corresponding path program 1 times [2025-03-08 22:46:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493655609] [2025-03-08 22:46:47,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:47,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:46:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:46:47,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:47,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493655609] [2025-03-08 22:46:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493655609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112912062] [2025-03-08 22:46:47,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:47,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:47,520 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:46:47,522 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:46:47,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:46:47,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:46:47,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:47,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:47,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 22:46:47,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:47,796 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:46:47,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-08 22:46:47,945 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-08 22:46:47,945 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 18 treesize of output 20 [2025-03-08 22:46:48,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:48,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-03-08 22:46:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:48,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112912062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:48,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:46:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2025-03-08 22:46:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049545820] [2025-03-08 22:46:48,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:46:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:48,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:46:48,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:46:48,141 INFO L87 Difference]: Start difference. First operand 1023 states and 1489 transitions. Second operand has 25 states, 24 states have (on average 4.291666666666667) internal successors, (103), 21 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:46:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:49,010 INFO L93 Difference]: Finished difference Result 1655 states and 2388 transitions. [2025-03-08 22:46:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 22:46:49,010 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.291666666666667) internal successors, (103), 21 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-03-08 22:46:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:49,014 INFO L225 Difference]: With dead ends: 1655 [2025-03-08 22:46:49,014 INFO L226 Difference]: Without dead ends: 1655 [2025-03-08 22:46:49,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 22:46:49,014 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1045 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:49,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1996 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:46:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-03-08 22:46:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1245. [2025-03-08 22:46:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1140 states have (on average 1.506140350877193) internal successors, (1717), 1195 states have internal predecessors, (1717), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (44), 33 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 22:46:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1805 transitions. [2025-03-08 22:46:49,027 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1805 transitions. Word has length 57 [2025-03-08 22:46:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1805 transitions. [2025-03-08 22:46:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.291666666666667) internal successors, (103), 21 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:46:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1805 transitions. [2025-03-08 22:46:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 22:46:49,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:49,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:49,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:46:49,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-08 22:46:49,228 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 193501671, now seen corresponding path program 1 times [2025-03-08 22:46:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:49,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370769954] [2025-03-08 22:46:49,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:49,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:46:49,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:46:49,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:49,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370769954] [2025-03-08 22:46:49,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370769954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764474000] [2025-03-08 22:46:49,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:49,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:46:49,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:46:50,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:46:50,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:46:50,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:50,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:50,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-08 22:46:50,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:50,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:46:50,328 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:46:50,335 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:46:50,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 22:46:50,392 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 36 treesize of output 27 [2025-03-08 22:46:50,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:50,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-08 22:46:50,539 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 22:46:50,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 22:46:50,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-08 22:46:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:50,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764474000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:50,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:46:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 30 [2025-03-08 22:46:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992010265] [2025-03-08 22:46:50,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:50,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 22:46:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:50,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 22:46:50,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:46:50,911 INFO L87 Difference]: Start difference. First operand 1245 states and 1805 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 27 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:46:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:52,680 INFO L93 Difference]: Finished difference Result 1667 states and 2402 transitions. [2025-03-08 22:46:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 22:46:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 27 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-03-08 22:46:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:52,683 INFO L225 Difference]: With dead ends: 1667 [2025-03-08 22:46:52,683 INFO L226 Difference]: Without dead ends: 1667 [2025-03-08 22:46:52,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=485, Invalid=3675, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 22:46:52,684 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 831 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:52,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 2673 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 22:46:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-08 22:46:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1245. [2025-03-08 22:46:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1140 states have (on average 1.5043859649122806) internal successors, (1715), 1195 states have internal predecessors, (1715), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (44), 33 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 22:46:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1803 transitions. [2025-03-08 22:46:52,697 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1803 transitions. Word has length 57 [2025-03-08 22:46:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:52,697 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1803 transitions. [2025-03-08 22:46:52,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 27 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:46:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1803 transitions. [2025-03-08 22:46:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 22:46:52,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:52,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:52,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:46:52,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-08 22:46:52,898 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:52,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1075351096, now seen corresponding path program 1 times [2025-03-08 22:46:52,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:52,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484185023] [2025-03-08 22:46:52,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:52,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:46:52,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:46:52,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:52,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484185023] [2025-03-08 22:46:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484185023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:46:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496539514] [2025-03-08 22:46:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:46:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:53,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:46:53,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:53,170 INFO L87 Difference]: Start difference. First operand 1245 states and 1803 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:53,519 INFO L93 Difference]: Finished difference Result 1651 states and 2386 transitions. [2025-03-08 22:46:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:46:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2025-03-08 22:46:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:53,523 INFO L225 Difference]: With dead ends: 1651 [2025-03-08 22:46:53,523 INFO L226 Difference]: Without dead ends: 1651 [2025-03-08 22:46:53,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:46:53,524 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 164 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:53,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1801 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-03-08 22:46:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1465. [2025-03-08 22:46:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1346 states have (on average 1.5170876671619613) internal successors, (2042), 1405 states have internal predecessors, (2042), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 39 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 22:46:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2150 transitions. [2025-03-08 22:46:53,546 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2150 transitions. Word has length 58 [2025-03-08 22:46:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:53,546 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 2150 transitions. [2025-03-08 22:46:53,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2150 transitions. [2025-03-08 22:46:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 22:46:53,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:53,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:53,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 22:46:53,547 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:53,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1675486373, now seen corresponding path program 1 times [2025-03-08 22:46:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810175714] [2025-03-08 22:46:53,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:53,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:46:53,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:46:53,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:53,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:53,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810175714] [2025-03-08 22:46:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810175714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270001508] [2025-03-08 22:46:53,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:53,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:53,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:53,664 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:46:53,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:46:53,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:46:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:46:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:53,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:46:53,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:54,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270001508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:54,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2025-03-08 22:46:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161422936] [2025-03-08 22:46:54,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:54,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:54,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:54,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:54,002 INFO L87 Difference]: Start difference. First operand 1465 states and 2150 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:54,110 INFO L93 Difference]: Finished difference Result 1472 states and 2088 transitions. [2025-03-08 22:46:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:54,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-08 22:46:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:54,114 INFO L225 Difference]: With dead ends: 1472 [2025-03-08 22:46:54,114 INFO L226 Difference]: Without dead ends: 1472 [2025-03-08 22:46:54,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:46:54,114 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 226 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:54,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 336 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2025-03-08 22:46:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1462. [2025-03-08 22:46:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1346 states have (on average 1.463595839524517) internal successors, (1970), 1402 states have internal predecessors, (1970), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 39 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 22:46:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2078 transitions. [2025-03-08 22:46:54,127 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2078 transitions. Word has length 60 [2025-03-08 22:46:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:54,127 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 2078 transitions. [2025-03-08 22:46:54,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2078 transitions. [2025-03-08 22:46:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 22:46:54,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:54,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:54,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:54,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:54,330 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:54,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash 150597168, now seen corresponding path program 1 times [2025-03-08 22:46:54,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:54,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444025359] [2025-03-08 22:46:54,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:54,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:54,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:46:54,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:46:54,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:54,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444025359] [2025-03-08 22:46:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444025359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 22:46:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558874540] [2025-03-08 22:46:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:46:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:54,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:46:54,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:46:54,724 INFO L87 Difference]: Start difference. First operand 1462 states and 2078 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:55,072 INFO L93 Difference]: Finished difference Result 1655 states and 2309 transitions. [2025-03-08 22:46:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:46:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-03-08 22:46:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:55,078 INFO L225 Difference]: With dead ends: 1655 [2025-03-08 22:46:55,078 INFO L226 Difference]: Without dead ends: 1655 [2025-03-08 22:46:55,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:46:55,079 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 467 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:55,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1513 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-03-08 22:46:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1478. [2025-03-08 22:46:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1362 states have (on average 1.4625550660792952) internal successors, (1992), 1418 states have internal predecessors, (1992), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 39 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 22:46:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2100 transitions. [2025-03-08 22:46:55,092 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2100 transitions. Word has length 59 [2025-03-08 22:46:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:55,092 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 2100 transitions. [2025-03-08 22:46:55,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2100 transitions. [2025-03-08 22:46:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 22:46:55,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:55,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:55,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 22:46:55,093 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:55,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1893407503, now seen corresponding path program 1 times [2025-03-08 22:46:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:55,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852211551] [2025-03-08 22:46:55,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:55,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:46:55,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:46:55,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:55,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852211551] [2025-03-08 22:46:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852211551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:46:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066447912] [2025-03-08 22:46:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:46:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:55,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:46:55,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:46:55,271 INFO L87 Difference]: Start difference. First operand 1478 states and 2100 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:55,503 INFO L93 Difference]: Finished difference Result 1656 states and 2320 transitions. [2025-03-08 22:46:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:46:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-03-08 22:46:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:55,507 INFO L225 Difference]: With dead ends: 1656 [2025-03-08 22:46:55,507 INFO L226 Difference]: Without dead ends: 1656 [2025-03-08 22:46:55,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:46:55,507 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 154 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:55,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1055 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-03-08 22:46:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1463. [2025-03-08 22:46:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1347 states have (on average 1.4632516703786191) internal successors, (1971), 1403 states have internal predecessors, (1971), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 39 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 22:46:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2079 transitions. [2025-03-08 22:46:55,522 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2079 transitions. Word has length 59 [2025-03-08 22:46:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:55,522 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 2079 transitions. [2025-03-08 22:46:55,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:46:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2079 transitions. [2025-03-08 22:46:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 22:46:55,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:55,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:55,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 22:46:55,523 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:55,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1695366194, now seen corresponding path program 1 times [2025-03-08 22:46:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163915243] [2025-03-08 22:46:55,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:55,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:46:55,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:46:55,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:55,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:46:55,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:55,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163915243] [2025-03-08 22:46:55,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163915243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:55,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:55,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:46:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335121029] [2025-03-08 22:46:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:55,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:55,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:55,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:55,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:55,602 INFO L87 Difference]: Start difference. First operand 1463 states and 2079 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:46:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:55,641 INFO L93 Difference]: Finished difference Result 1463 states and 2073 transitions. [2025-03-08 22:46:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:55,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2025-03-08 22:46:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:55,646 INFO L225 Difference]: With dead ends: 1463 [2025-03-08 22:46:55,646 INFO L226 Difference]: Without dead ends: 1463 [2025-03-08 22:46:55,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:55,647 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 58 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:55,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 582 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-08 22:46:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2025-03-08 22:46:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1347 states have (on average 1.457312546399406) internal successors, (1963), 1401 states have internal predecessors, (1963), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 39 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 22:46:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2071 transitions. [2025-03-08 22:46:55,660 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2071 transitions. Word has length 63 [2025-03-08 22:46:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:55,660 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2071 transitions. [2025-03-08 22:46:55,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:46:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2071 transitions. [2025-03-08 22:46:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 22:46:55,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:55,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:55,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 22:46:55,661 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1800614953, now seen corresponding path program 1 times [2025-03-08 22:46:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:55,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045033682] [2025-03-08 22:46:55,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:55,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:46:55,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:46:55,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:55,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045033682] [2025-03-08 22:46:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045033682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101334949] [2025-03-08 22:46:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:55,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:46:55,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:46:55,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:46:55,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:46:55,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:55,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:55,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:46:55,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:55,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:55,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101334949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:55,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:55,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-08 22:46:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421500132] [2025-03-08 22:46:55,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:55,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:55,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:55,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:55,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:55,954 INFO L87 Difference]: Start difference. First operand 1461 states and 2071 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:55,977 INFO L93 Difference]: Finished difference Result 3931 states and 5565 transitions. [2025-03-08 22:46:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2025-03-08 22:46:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:55,992 INFO L225 Difference]: With dead ends: 3931 [2025-03-08 22:46:55,992 INFO L226 Difference]: Without dead ends: 3931 [2025-03-08 22:46:55,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:55,995 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 378 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 794 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:46:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2025-03-08 22:46:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 2744. [2025-03-08 22:46:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2744 states, 2578 states have (on average 1.4627618308766486) internal successors, (3771), 2647 states have internal predecessors, (3771), 106 states have call successors, (106), 20 states have call predecessors, (106), 20 states have return successors, (106), 76 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 22:46:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3983 transitions. [2025-03-08 22:46:56,029 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3983 transitions. Word has length 62 [2025-03-08 22:46:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:56,029 INFO L471 AbstractCegarLoop]: Abstraction has 2744 states and 3983 transitions. [2025-03-08 22:46:56,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3983 transitions. [2025-03-08 22:46:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 22:46:56,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:56,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:56,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:46:56,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:56,231 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:46:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1800615306, now seen corresponding path program 1 times [2025-03-08 22:46:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940064769] [2025-03-08 22:46:56,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:56,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:46:56,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:46:56,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:56,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:56,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940064769] [2025-03-08 22:46:56,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940064769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:56,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944668386] [2025-03-08 22:46:56,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:56,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:56,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:46:56,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:46:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:46:56,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:46:56,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:56,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:56,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 22:46:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:56,955 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:46:57,028 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 43 treesize of output 30 [2025-03-08 22:46:57,407 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:46:57,408 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 20 [2025-03-08 22:46:57,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:46:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:57,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:57,512 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 106 treesize of output 102 [2025-03-08 22:46:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944668386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:58,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:46:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2025-03-08 22:46:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379602869] [2025-03-08 22:46:58,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:46:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:58,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:46:58,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:46:58,533 INFO L87 Difference]: Start difference. First operand 2744 states and 3983 transitions. Second operand has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:03,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:47:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:04,177 INFO L93 Difference]: Finished difference Result 2855 states and 4122 transitions. [2025-03-08 22:47:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:47:04,181 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2025-03-08 22:47:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:04,186 INFO L225 Difference]: With dead ends: 2855 [2025-03-08 22:47:04,187 INFO L226 Difference]: Without dead ends: 2845 [2025-03-08 22:47:04,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 22:47:04,188 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 450 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:04,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 2159 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1407 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-03-08 22:47:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2025-03-08 22:47:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2758. [2025-03-08 22:47:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2758 states, 2592 states have (on average 1.4625771604938271) internal successors, (3791), 2661 states have internal predecessors, (3791), 106 states have call successors, (106), 20 states have call predecessors, (106), 20 states have return successors, (106), 76 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 22:47:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 4003 transitions. [2025-03-08 22:47:04,215 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 4003 transitions. Word has length 62 [2025-03-08 22:47:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:04,215 INFO L471 AbstractCegarLoop]: Abstraction has 2758 states and 4003 transitions. [2025-03-08 22:47:04,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 4003 transitions. [2025-03-08 22:47:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 22:47:04,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:04,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:47:04,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-08 22:47:04,417 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:04,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash 697400631, now seen corresponding path program 1 times [2025-03-08 22:47:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:04,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663666095] [2025-03-08 22:47:04,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:04,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:47:04,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:47:04,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663666095] [2025-03-08 22:47:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663666095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877328955] [2025-03-08 22:47:04,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:04,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:04,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:04,644 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:04,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:47:04,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:47:04,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:47:04,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:04,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:04,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 22:47:04,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:05,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:47:05,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:47:05,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2025-03-08 22:47:05,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:47:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:05,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:05,425 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 44 treesize of output 38 [2025-03-08 22:47:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877328955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:10,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:47:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2025-03-08 22:47:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378412796] [2025-03-08 22:47:10,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:10,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:47:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:10,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:47:10,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=670, Unknown=1, NotChecked=0, Total=756 [2025-03-08 22:47:10,292 INFO L87 Difference]: Start difference. First operand 2758 states and 4003 transitions. Second operand has 21 states, 20 states have (on average 5.7) internal successors, (114), 21 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:11,008 INFO L93 Difference]: Finished difference Result 2847 states and 4113 transitions. [2025-03-08 22:47:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:47:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.7) internal successors, (114), 21 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2025-03-08 22:47:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:11,013 INFO L225 Difference]: With dead ends: 2847 [2025-03-08 22:47:11,013 INFO L226 Difference]: Without dead ends: 2835 [2025-03-08 22:47:11,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=132, Invalid=1057, Unknown=1, NotChecked=0, Total=1190 [2025-03-08 22:47:11,013 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 268 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:11,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1824 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1177 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:47:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2025-03-08 22:47:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2756. [2025-03-08 22:47:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2590 states have (on average 1.4625482625482626) internal successors, (3788), 2659 states have internal predecessors, (3788), 106 states have call successors, (106), 20 states have call predecessors, (106), 20 states have return successors, (106), 76 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 22:47:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 4000 transitions. [2025-03-08 22:47:11,064 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 4000 transitions. Word has length 62 [2025-03-08 22:47:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:11,064 INFO L471 AbstractCegarLoop]: Abstraction has 2756 states and 4000 transitions. [2025-03-08 22:47:11,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.7) internal successors, (114), 21 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 4000 transitions. [2025-03-08 22:47:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 22:47:11,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:11,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:11,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:47:11,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-08 22:47:11,266 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:11,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1345438453, now seen corresponding path program 1 times [2025-03-08 22:47:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:11,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644621118] [2025-03-08 22:47:11,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:11,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:47:11,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:47:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:47:11,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:11,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644621118] [2025-03-08 22:47:11,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644621118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:11,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:11,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511839979] [2025-03-08 22:47:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:11,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:11,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:11,318 INFO L87 Difference]: Start difference. First operand 2756 states and 4000 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:11,335 INFO L93 Difference]: Finished difference Result 2926 states and 4216 transitions. [2025-03-08 22:47:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:47:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-08 22:47:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:11,340 INFO L225 Difference]: With dead ends: 2926 [2025-03-08 22:47:11,340 INFO L226 Difference]: Without dead ends: 2926 [2025-03-08 22:47:11,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:11,341 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 69 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:11,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 510 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2025-03-08 22:47:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2766. [2025-03-08 22:47:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2600 states have (on average 1.4615384615384615) internal successors, (3800), 2669 states have internal predecessors, (3800), 106 states have call successors, (106), 20 states have call predecessors, (106), 20 states have return successors, (106), 76 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 22:47:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4012 transitions. [2025-03-08 22:47:11,367 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4012 transitions. Word has length 63 [2025-03-08 22:47:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4012 transitions. [2025-03-08 22:47:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4012 transitions. [2025-03-08 22:47:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 22:47:11,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:11,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:11,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 22:47:11,369 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:11,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:11,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1345438484, now seen corresponding path program 1 times [2025-03-08 22:47:11,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:11,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812256768] [2025-03-08 22:47:11,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:11,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:11,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:47:11,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:47:11,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:11,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 22:47:11,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:11,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812256768] [2025-03-08 22:47:11,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812256768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:11,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:11,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:47:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470589867] [2025-03-08 22:47:11,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:11,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:11,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:11,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:11,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:11,433 INFO L87 Difference]: Start difference. First operand 2766 states and 4012 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:11,570 INFO L93 Difference]: Finished difference Result 2766 states and 4008 transitions. [2025-03-08 22:47:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-08 22:47:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:11,576 INFO L225 Difference]: With dead ends: 2766 [2025-03-08 22:47:11,576 INFO L226 Difference]: Without dead ends: 2766 [2025-03-08 22:47:11,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:47:11,577 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 32 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:11,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 527 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2025-03-08 22:47:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2766. [2025-03-08 22:47:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2600 states have (on average 1.46) internal successors, (3796), 2669 states have internal predecessors, (3796), 106 states have call successors, (106), 20 states have call predecessors, (106), 20 states have return successors, (106), 76 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 22:47:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4008 transitions. [2025-03-08 22:47:11,604 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4008 transitions. Word has length 63 [2025-03-08 22:47:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:11,604 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4008 transitions. [2025-03-08 22:47:11,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4008 transitions. [2025-03-08 22:47:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 22:47:11,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:11,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:11,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 22:47:11,605 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1345438485, now seen corresponding path program 1 times [2025-03-08 22:47:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:11,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933977880] [2025-03-08 22:47:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:11,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:47:11,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:47:11,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:11,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 22:47:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933977880] [2025-03-08 22:47:11,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933977880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:11,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:47:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540885754] [2025-03-08 22:47:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:11,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:11,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:11,705 INFO L87 Difference]: Start difference. First operand 2766 states and 4008 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:11,841 INFO L93 Difference]: Finished difference Result 2762 states and 3972 transitions. [2025-03-08 22:47:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:11,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-08 22:47:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:11,845 INFO L225 Difference]: With dead ends: 2762 [2025-03-08 22:47:11,845 INFO L226 Difference]: Without dead ends: 2762 [2025-03-08 22:47:11,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:47:11,845 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 32 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:11,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 576 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2025-03-08 22:47:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2025-03-08 22:47:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2600 states have (on average 1.4461538461538461) internal successors, (3760), 2665 states have internal predecessors, (3760), 106 states have call successors, (106), 20 states have call predecessors, (106), 20 states have return successors, (106), 76 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 22:47:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3972 transitions. [2025-03-08 22:47:11,867 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 3972 transitions. Word has length 63 [2025-03-08 22:47:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:11,867 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 3972 transitions. [2025-03-08 22:47:11,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3972 transitions. [2025-03-08 22:47:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 22:47:11,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:11,868 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 22:47:11,868 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:11,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1016745825, now seen corresponding path program 1 times [2025-03-08 22:47:11,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243802458] [2025-03-08 22:47:11,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:11,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:47:11,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:47:11,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:11,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:47:12,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243802458] [2025-03-08 22:47:12,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243802458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:12,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:12,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:47:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166989237] [2025-03-08 22:47:12,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:12,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:47:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:12,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:47:12,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:47:12,143 INFO L87 Difference]: Start difference. First operand 2762 states and 3972 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:12,384 INFO L93 Difference]: Finished difference Result 3619 states and 5164 transitions. [2025-03-08 22:47:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:47:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2025-03-08 22:47:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:12,390 INFO L225 Difference]: With dead ends: 3619 [2025-03-08 22:47:12,390 INFO L226 Difference]: Without dead ends: 3619 [2025-03-08 22:47:12,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:47:12,392 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 183 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:12,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 997 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2025-03-08 22:47:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3238. [2025-03-08 22:47:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 3052 states have (on average 1.4508519003931848) internal successors, (4428), 3125 states have internal predecessors, (4428), 126 states have call successors, (126), 24 states have call predecessors, (126), 24 states have return successors, (126), 88 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 22:47:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4680 transitions. [2025-03-08 22:47:12,429 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4680 transitions. Word has length 64 [2025-03-08 22:47:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:12,429 INFO L471 AbstractCegarLoop]: Abstraction has 3238 states and 4680 transitions. [2025-03-08 22:47:12,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4680 transitions. [2025-03-08 22:47:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 22:47:12,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:12,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:12,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 22:47:12,431 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1218179058, now seen corresponding path program 1 times [2025-03-08 22:47:12,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:12,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50639785] [2025-03-08 22:47:12,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:12,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:47:12,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:47:12,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:12,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 22:47:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50639785] [2025-03-08 22:47:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50639785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:47:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075818947] [2025-03-08 22:47:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:12,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:12,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:12,497 INFO L87 Difference]: Start difference. First operand 3238 states and 4680 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:12,657 INFO L93 Difference]: Finished difference Result 3276 states and 4704 transitions. [2025-03-08 22:47:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:47:12,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2025-03-08 22:47:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:12,663 INFO L225 Difference]: With dead ends: 3276 [2025-03-08 22:47:12,663 INFO L226 Difference]: Without dead ends: 3276 [2025-03-08 22:47:12,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:47:12,664 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 16 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:12,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 537 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2025-03-08 22:47:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3236. [2025-03-08 22:47:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 3052 states have (on average 1.4456094364351244) internal successors, (4412), 3123 states have internal predecessors, (4412), 126 states have call successors, (126), 24 states have call predecessors, (126), 24 states have return successors, (126), 88 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 22:47:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4664 transitions. [2025-03-08 22:47:12,721 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4664 transitions. Word has length 64 [2025-03-08 22:47:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:12,721 INFO L471 AbstractCegarLoop]: Abstraction has 3236 states and 4664 transitions. [2025-03-08 22:47:12,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:47:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4664 transitions. [2025-03-08 22:47:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 22:47:12,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:12,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:12,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 22:47:12,723 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1218179057, now seen corresponding path program 1 times [2025-03-08 22:47:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895365562] [2025-03-08 22:47:12,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:12,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:47:12,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:47:12,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:12,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:47:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895365562] [2025-03-08 22:47:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895365562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118371027] [2025-03-08 22:47:13,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:13,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:13,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:13,904 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:13,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:47:14,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:47:14,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:47:14,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:14,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:14,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-08 22:47:14,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:14,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:47:14,377 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:47:14,384 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:47:14,475 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 36 treesize of output 27 [2025-03-08 22:47:14,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 22:47:14,715 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 22:47:14,715 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:47:14,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-08 22:47:14,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-08 22:47:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:14,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:15,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118371027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:15,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:47:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 14] total 42 [2025-03-08 22:47:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466029473] [2025-03-08 22:47:15,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:15,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 22:47:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:15,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 22:47:15,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2205, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 22:47:15,245 INFO L87 Difference]: Start difference. First operand 3236 states and 4664 transitions. Second operand has 43 states, 42 states have (on average 2.857142857142857) internal successors, (120), 41 states have internal predecessors, (120), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:47:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:19,735 INFO L93 Difference]: Finished difference Result 5154 states and 7266 transitions. [2025-03-08 22:47:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-08 22:47:19,736 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.857142857142857) internal successors, (120), 41 states have internal predecessors, (120), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 64 [2025-03-08 22:47:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:19,740 INFO L225 Difference]: With dead ends: 5154 [2025-03-08 22:47:19,740 INFO L226 Difference]: Without dead ends: 5154 [2025-03-08 22:47:19,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3501 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1379, Invalid=12193, Unknown=0, NotChecked=0, Total=13572 [2025-03-08 22:47:19,741 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 952 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 3672 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 4622 SdHoareTripleChecker+Invalid, 3733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:19,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 4622 Invalid, 3733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3672 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 22:47:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2025-03-08 22:47:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 4350. [2025-03-08 22:47:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4350 states, 4118 states have (on average 1.4380767362797475) internal successors, (5922), 4197 states have internal predecessors, (5922), 166 states have call successors, (166), 32 states have call predecessors, (166), 32 states have return successors, (166), 120 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 22:47:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 6254 transitions. [2025-03-08 22:47:19,779 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 6254 transitions. Word has length 64 [2025-03-08 22:47:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:19,779 INFO L471 AbstractCegarLoop]: Abstraction has 4350 states and 6254 transitions. [2025-03-08 22:47:19,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.857142857142857) internal successors, (120), 41 states have internal predecessors, (120), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:47:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 6254 transitions. [2025-03-08 22:47:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 22:47:19,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:19,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:19,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:47:19,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-03-08 22:47:19,981 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1454349473, now seen corresponding path program 1 times [2025-03-08 22:47:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369377835] [2025-03-08 22:47:19,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:19,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:47:19,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:47:19,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:19,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:47:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:20,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369377835] [2025-03-08 22:47:20,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369377835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:20,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:20,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:47:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543701702] [2025-03-08 22:47:20,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:20,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:47:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:20,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:47:20,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:47:20,206 INFO L87 Difference]: Start difference. First operand 4350 states and 6254 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:20,492 INFO L93 Difference]: Finished difference Result 4799 states and 6796 transitions. [2025-03-08 22:47:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:47:20,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2025-03-08 22:47:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:20,496 INFO L225 Difference]: With dead ends: 4799 [2025-03-08 22:47:20,496 INFO L226 Difference]: Without dead ends: 4799 [2025-03-08 22:47:20,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:47:20,497 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 203 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:20,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 946 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4799 states. [2025-03-08 22:47:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4799 to 4350. [2025-03-08 22:47:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4350 states, 4118 states have (on average 1.4322486644001942) internal successors, (5898), 4197 states have internal predecessors, (5898), 166 states have call successors, (166), 32 states have call predecessors, (166), 32 states have return successors, (166), 120 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 22:47:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 6230 transitions. [2025-03-08 22:47:20,539 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 6230 transitions. Word has length 65 [2025-03-08 22:47:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:20,540 INFO L471 AbstractCegarLoop]: Abstraction has 4350 states and 6230 transitions. [2025-03-08 22:47:20,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 6230 transitions. [2025-03-08 22:47:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 22:47:20,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:20,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 22:47:20,541 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1454307734, now seen corresponding path program 1 times [2025-03-08 22:47:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959307236] [2025-03-08 22:47:20,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:20,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:47:20,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:47:20,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:20,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:47:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959307236] [2025-03-08 22:47:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959307236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 22:47:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310480810] [2025-03-08 22:47:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:47:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:20,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:47:20,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:47:20,952 INFO L87 Difference]: Start difference. First operand 4350 states and 6230 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:21,405 INFO L93 Difference]: Finished difference Result 4829 states and 6866 transitions. [2025-03-08 22:47:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:47:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2025-03-08 22:47:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:21,410 INFO L225 Difference]: With dead ends: 4829 [2025-03-08 22:47:21,410 INFO L226 Difference]: Without dead ends: 4829 [2025-03-08 22:47:21,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:47:21,410 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 322 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:21,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1384 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2025-03-08 22:47:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 4409. [2025-03-08 22:47:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4178 states have (on average 1.4365725227381523) internal successors, (6002), 4256 states have internal predecessors, (6002), 166 states have call successors, (166), 32 states have call predecessors, (166), 32 states have return successors, (166), 120 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 22:47:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6334 transitions. [2025-03-08 22:47:21,454 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6334 transitions. Word has length 65 [2025-03-08 22:47:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:21,454 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 6334 transitions. [2025-03-08 22:47:21,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6334 transitions. [2025-03-08 22:47:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 22:47:21,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:21,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:21,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 22:47:21,455 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1454307733, now seen corresponding path program 1 times [2025-03-08 22:47:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125978566] [2025-03-08 22:47:21,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:21,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:47:21,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:47:21,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:21,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:47:21,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:21,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125978566] [2025-03-08 22:47:21,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125978566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:21,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:21,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:47:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321186536] [2025-03-08 22:47:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:21,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:47:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:21,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:47:21,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:47:21,926 INFO L87 Difference]: Start difference. First operand 4409 states and 6334 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:22,209 INFO L93 Difference]: Finished difference Result 4710 states and 6675 transitions. [2025-03-08 22:47:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:47:22,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2025-03-08 22:47:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:22,214 INFO L225 Difference]: With dead ends: 4710 [2025-03-08 22:47:22,214 INFO L226 Difference]: Without dead ends: 4710 [2025-03-08 22:47:22,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:47:22,214 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 242 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:22,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 979 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2025-03-08 22:47:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 4397. [2025-03-08 22:47:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4166 states have (on average 1.42966874699952) internal successors, (5956), 4244 states have internal predecessors, (5956), 166 states have call successors, (166), 32 states have call predecessors, (166), 32 states have return successors, (166), 120 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 22:47:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 6288 transitions. [2025-03-08 22:47:22,248 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 6288 transitions. Word has length 65 [2025-03-08 22:47:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:22,248 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 6288 transitions. [2025-03-08 22:47:22,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 6288 transitions. [2025-03-08 22:47:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 22:47:22,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:22,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 22:47:22,249 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2135160675, now seen corresponding path program 1 times [2025-03-08 22:47:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010643300] [2025-03-08 22:47:22,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:22,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:47:22,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:47:22,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:22,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:47:22,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:22,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010643300] [2025-03-08 22:47:22,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010643300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:22,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:22,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:47:22,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518065593] [2025-03-08 22:47:22,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:22,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:47:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:22,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:47:22,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:47:22,586 INFO L87 Difference]: Start difference. First operand 4397 states and 6288 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:22,920 INFO L93 Difference]: Finished difference Result 4828 states and 6816 transitions. [2025-03-08 22:47:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:47:22,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2025-03-08 22:47:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:22,926 INFO L225 Difference]: With dead ends: 4828 [2025-03-08 22:47:22,926 INFO L226 Difference]: Without dead ends: 4828 [2025-03-08 22:47:22,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:47:22,927 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 224 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:22,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 962 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2025-03-08 22:47:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4475. [2025-03-08 22:47:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 4244 states have (on average 1.4250706880301602) internal successors, (6048), 4322 states have internal predecessors, (6048), 166 states have call successors, (166), 32 states have call predecessors, (166), 32 states have return successors, (166), 120 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 22:47:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 6380 transitions. [2025-03-08 22:47:22,984 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 6380 transitions. Word has length 66 [2025-03-08 22:47:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:22,984 INFO L471 AbstractCegarLoop]: Abstraction has 4475 states and 6380 transitions. [2025-03-08 22:47:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 6380 transitions. [2025-03-08 22:47:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 22:47:22,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:22,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 22:47:22,985 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:22,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1765471459, now seen corresponding path program 1 times [2025-03-08 22:47:22,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677271940] [2025-03-08 22:47:22,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:22,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:47:23,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:47:23,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:23,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:47:23,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677271940] [2025-03-08 22:47:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677271940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588953940] [2025-03-08 22:47:23,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:23,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:23,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:23,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:23,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:47:23,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:47:23,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:47:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:23,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 22:47:23,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:23,580 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:47:23,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:47:23,728 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 11 treesize of output 7 [2025-03-08 22:47:23,772 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 26 treesize of output 21 [2025-03-08 22:47:23,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:47:23,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 11 [2025-03-08 22:47:23,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:47:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:23,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588953940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:47:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 24 [2025-03-08 22:47:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280491464] [2025-03-08 22:47:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:47:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:23,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:47:23,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:47:23,999 INFO L87 Difference]: Start difference. First operand 4475 states and 6380 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:24,492 INFO L93 Difference]: Finished difference Result 6559 states and 9268 transitions. [2025-03-08 22:47:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:47:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2025-03-08 22:47:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:24,499 INFO L225 Difference]: With dead ends: 6559 [2025-03-08 22:47:24,499 INFO L226 Difference]: Without dead ends: 6559 [2025-03-08 22:47:24,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:47:24,499 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 283 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:24,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1010 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6559 states. [2025-03-08 22:47:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6559 to 5712. [2025-03-08 22:47:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5712 states, 5415 states have (on average 1.412927054478301) internal successors, (7651), 5505 states have internal predecessors, (7651), 222 states have call successors, (222), 42 states have call predecessors, (222), 42 states have return successors, (222), 164 states have call predecessors, (222), 222 states have call successors, (222) [2025-03-08 22:47:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 8095 transitions. [2025-03-08 22:47:24,548 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 8095 transitions. Word has length 67 [2025-03-08 22:47:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:24,548 INFO L471 AbstractCegarLoop]: Abstraction has 5712 states and 8095 transitions. [2025-03-08 22:47:24,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:47:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 8095 transitions. [2025-03-08 22:47:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 22:47:24,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:24,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:24,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 22:47:24,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-03-08 22:47:24,750 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-08 22:47:24,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1930115985, now seen corresponding path program 1 times [2025-03-08 22:47:24,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:24,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823881662] [2025-03-08 22:47:24,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:24,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:47:24,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:47:24,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:24,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:47:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823881662] [2025-03-08 22:47:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823881662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053157615] [2025-03-08 22:47:26,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:26,707 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:26,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:47:26,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:47:26,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:47:26,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:26,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:26,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-03-08 22:47:26,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:26,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:47:26,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:47:27,099 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 11 treesize of output 7 [2025-03-08 22:47:27,105 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 11 treesize of output 7 [2025-03-08 22:47:27,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:47:27,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 22:47:27,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:47:27,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 22:47:27,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:47:27,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:47:27,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:47:27,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:47:27,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:47:27,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:47:27,652 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 22:47:27,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2025-03-08 22:47:27,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2025-03-08 22:47:28,379 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2025-03-08 22:47:28,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 37 [2025-03-08 22:47:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:28,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:35,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_append_one_~list#1.offset| 4))) (and (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse1 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse1 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~head~0#1.base|) .cse2 |c_ULTIMATE.start_create_item_~head~0#1.base|))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) |c_~#list~0.offset|))) (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~head~0#1.offset|) .cse2 v_ArrVal_1936))) |c_~#list~0.base|) |c_~#list~0.offset|) 4)) 0)) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~head~0#1.offset|) .cse2 v_ArrVal_1936))))) (select (select .cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse5 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse5 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~head~0#1.base|) .cse2 |c_ULTIMATE.start_create_item_~head~0#1.base|))) |c_~#list~0.base|) |c_~#list~0.offset|)) (+ (select (select .cse4 |c_~#list~0.base|) |c_~#list~0.offset|) 4))) 0)))) is different from false [2025-03-08 22:47:35,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_append_one_~list#1.offset| 4))) (and (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse1 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse1 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse2 |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) |c_~#list~0.offset|))) (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse2 v_ArrVal_1936))) |c_~#list~0.base|) |c_~#list~0.offset|) 4)) 0)) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse2 v_ArrVal_1936))))) (select (select .cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse5 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse5 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse2 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) |c_~#list~0.offset|)) (+ (select (select .cse4 |c_~#list~0.base|) |c_~#list~0.offset|) 4))) 0)))) is different from false [2025-03-08 22:47:35,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_append_one_~list#1.offset| 4))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1929 .cse1)) v_ArrVal_1929)) (forall ((v_ArrVal_1930 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_1930 .cse1)) v_ArrVal_1930)) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (let ((.cse3 (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse5 v_ArrVal_1936))))) (select (select .cse3 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse4 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse4 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse5 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) |c_~#list~0.offset|)) (+ (select (select .cse3 |c_~#list~0.base|) |c_~#list~0.offset|) 4))) 0)))))) (forall ((v_ArrVal_1929 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1929 .cse1)) v_ArrVal_1929)) (forall ((v_ArrVal_1930 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_1930 .cse1)) v_ArrVal_1930)) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (let ((.cse7 (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse8 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse8 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse5 |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (select .cse7 (select (select .cse7 |c_~#list~0.base|) |c_~#list~0.offset|))) (+ (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse9 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse9 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse5 v_ArrVal_1936))) |c_~#list~0.base|) |c_~#list~0.offset|) 4)) 0)))))))) is different from false [2025-03-08 22:47:35,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (= 2 |c_ULTIMATE.start_create_item_~term_field~0#1|))) (let ((.cse0 (not .cse12)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| (* |c_ULTIMATE.start_create_item_~term_field~0#1| 4))) (.cse6 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_append_one_~list#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (or (= (select (let ((.cse1 (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (select .cse1 (select (select .cse1 |c_~#list~0.base|) |c_~#list~0.offset|))) (+ (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse4 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse4 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse3 v_ArrVal_1936))) |c_~#list~0.base|) |c_~#list~0.offset|) 4)) 0) (not (= (store .cse5 .cse6 (select v_ArrVal_1930 .cse6)) v_ArrVal_1930)) (not (= (store .cse7 .cse6 (select v_ArrVal_1929 .cse6)) v_ArrVal_1929))))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (or (not (= v_ArrVal_1930 (store (store .cse5 .cse8 (select v_ArrVal_1930 .cse8)) .cse6 (select v_ArrVal_1930 .cse6)))) (= (select (let ((.cse9 (let ((.cse10 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse10 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse10 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (select .cse9 (select (select .cse9 |c_~#list~0.base|) |c_~#list~0.offset|))) (+ (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse11 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse11 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse3 v_ArrVal_1936))) |c_~#list~0.base|) |c_~#list~0.offset|) 4)) 0) (not (= (store (store .cse7 .cse8 (select v_ArrVal_1929 .cse8)) .cse6 (select v_ArrVal_1929 .cse6)) v_ArrVal_1929)))) .cse12) (or .cse0 (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (or (not (= (store .cse5 .cse6 (select v_ArrVal_1930 .cse6)) v_ArrVal_1930)) (not (= (store .cse7 .cse6 (select v_ArrVal_1929 .cse6)) v_ArrVal_1929)) (= (let ((.cse13 (let ((.cse15 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse15 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse15 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse3 v_ArrVal_1936))))) (select (select .cse13 (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse14 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse14 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) |c_~#list~0.offset|)) (+ (select (select .cse13 |c_~#list~0.base|) |c_~#list~0.offset|) 4))) 0)))) (or .cse12 (forall ((v_ArrVal_1936 Int) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (or (not (= v_ArrVal_1930 (store (store .cse5 .cse8 (select v_ArrVal_1930 .cse8)) .cse6 (select v_ArrVal_1930 .cse6)))) (not (= (store (store .cse7 .cse8 (select v_ArrVal_1929 .cse8)) .cse6 (select v_ArrVal_1929 .cse6)) v_ArrVal_1929)) (= (let ((.cse16 (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1931))) (store .cse18 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse18 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|) .cse3 v_ArrVal_1936))))) (select (select .cse16 (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1932))) (store .cse17 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse17 |c_ULTIMATE.start_append_one_~list#1.base|) |c_ULTIMATE.start_append_one_~list#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) |c_~#list~0.offset|)) (+ (select (select .cse16 |c_~#list~0.base|) |c_~#list~0.offset|) 4))) 0))))))) is different from false [2025-03-08 22:47:36,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:47:36,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25436 treesize of output 25314 [2025-03-08 22:47:37,374 INFO L349 Elim1Store]: treesize reduction 224, result has 53.4 percent of original size [2025-03-08 22:47:37,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 5905996 treesize of output 5677918 [2025-03-08 22:47:40,848 INFO L349 Elim1Store]: treesize reduction 168, result has 57.7 percent of original size [2025-03-08 22:47:40,849 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 19952 treesize of output 18434 [2025-03-08 22:47:41,840 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 20593 treesize of output 20097