./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/diff-alloca-2.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 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:45:36,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:45:36,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:45:36,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:45:36,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:45:36,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:45:36,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:45:36,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:45:36,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:45:36,999 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:45:36,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:45:36,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:45:36,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:45:36,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:45:36,999 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:45:37,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:45:37,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:45:37,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:45:37,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:45:37,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:45:37,001 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:45:37,001 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:45:37,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:45:37,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:45:37,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:45:37,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:45:37,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:45:37,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:45:37,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:45:37,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:45:37,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:45:37,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:45:37,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:45:37,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:45:37,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:45:37,004 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 -> 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe [2025-03-17 11:45:37,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:45:37,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:45:37,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:45:37,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:45:37,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:45:37,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2025-03-17 11:45:38,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58396f8e2/744e3065f1704387899adda42f6b9438/FLAG0f4e694cd [2025-03-17 11:45:38,640 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:45:38,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2025-03-17 11:45:38,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58396f8e2/744e3065f1704387899adda42f6b9438/FLAG0f4e694cd [2025-03-17 11:45:38,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58396f8e2/744e3065f1704387899adda42f6b9438 [2025-03-17 11:45:38,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:45:38,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:45:38,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:38,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:45:38,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:45:38,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:38" (1/1) ... [2025-03-17 11:45:38,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea601e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:38, skipping insertion in model container [2025-03-17 11:45:38,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:38" (1/1) ... [2025-03-17 11:45:38,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:45:39,185 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:45:39,186 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:45:39,186 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:45:39,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:39,201 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:45:39,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:39,259 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:45:39,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39 WrapperNode [2025-03-17 11:45:39,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:39,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:39,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:45:39,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:45:39,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,290 INFO L138 Inliner]: procedures = 116, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2025-03-17 11:45:39,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:39,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:45:39,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:45:39,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:45:39,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,315 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 3 writes are split as follows [1, 1, 1]. [2025-03-17 11:45:39,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:45:39,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:45:39,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:45:39,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:45:39,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (1/1) ... [2025-03-17 11:45:39,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:45:39,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:39,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:45:39,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:45:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:45:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:45:39,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:45:39,456 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:45:39,457 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:45:39,656 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset; [2025-03-17 11:45:39,673 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-17 11:45:39,673 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:45:39,683 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:45:39,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:45:39,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:39 BoogieIcfgContainer [2025-03-17 11:45:39,684 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:45:39,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:45:39,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:45:39,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:45:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:45:38" (1/3) ... [2025-03-17 11:45:39,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32579e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:39, skipping insertion in model container [2025-03-17 11:45:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:39" (2/3) ... [2025-03-17 11:45:39,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32579e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:39, skipping insertion in model container [2025-03-17 11:45:39,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:39" (3/3) ... [2025-03-17 11:45:39,691 INFO L128 eAbstractionObserver]: Analyzing ICFG diff-alloca-2.i [2025-03-17 11:45:39,704 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:45:39,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diff-alloca-2.i that has 1 procedures, 36 locations, 1 initial locations, 4 loop locations, and 13 error locations. [2025-03-17 11:45:39,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:45:39,746 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;@2eae5528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:45:39,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:45:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 35 states have internal predecessors, (43), 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-17 11:45:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:39,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:39,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:39,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:39,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2137346212, now seen corresponding path program 1 times [2025-03-17 11:45:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:39,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728939810] [2025-03-17 11:45:39,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:39,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:39,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:39,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:40,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728939810] [2025-03-17 11:45:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728939810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:40,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234600467] [2025-03-17 11:45:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:40,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:40,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:40,083 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-17 11:45:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:40,125 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-17 11:45:40,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-17 11:45:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:40,135 INFO L225 Difference]: With dead ends: 35 [2025-03-17 11:45:40,135 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 11:45:40,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:40,139 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:40,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 11:45:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 11:45:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 32 states have internal predecessors, (40), 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-17 11:45:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-17 11:45:40,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 6 [2025-03-17 11:45:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:40,163 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-17 11:45:40,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-17 11:45:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-17 11:45:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:40,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:40,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:45:40,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:40,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2137346211, now seen corresponding path program 1 times [2025-03-17 11:45:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:40,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338239739] [2025-03-17 11:45:40,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:40,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:40,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:40,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:40,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338239739] [2025-03-17 11:45:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338239739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:40,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912773605] [2025-03-17 11:45:40,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:40,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:40,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:40,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:40,506 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-17 11:45:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:40,608 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-03-17 11:45:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-17 11:45:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:40,609 INFO L225 Difference]: With dead ends: 47 [2025-03-17 11:45:40,609 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 11:45:40,609 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-17 11:45:40,610 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:40,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 11:45:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2025-03-17 11:45:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.8) internal successors, (45), 36 states have internal predecessors, (45), 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-17 11:45:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-17 11:45:40,614 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 6 [2025-03-17 11:45:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:40,614 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-17 11:45:40,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-17 11:45:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-17 11:45:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:40,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:40,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:45:40,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2136422690, now seen corresponding path program 1 times [2025-03-17 11:45:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513799252] [2025-03-17 11:45:40,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:40,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:40,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:40,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:40,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513799252] [2025-03-17 11:45:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513799252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983980095] [2025-03-17 11:45:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:40,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:40,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:40,831 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-17 11:45:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:40,902 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-03-17 11:45:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-17 11:45:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:40,903 INFO L225 Difference]: With dead ends: 40 [2025-03-17 11:45:40,903 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 11:45:40,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:40,904 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:40,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 80 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 11:45:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-03-17 11:45:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.826086956521739) internal successors, (42), 34 states have internal predecessors, (42), 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-17 11:45:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-17 11:45:40,909 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 6 [2025-03-17 11:45:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:40,909 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-17 11:45:40,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-17 11:45:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-17 11:45:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:45:40,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:40,910 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:40,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:45:40,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:40,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash -790835387, now seen corresponding path program 1 times [2025-03-17 11:45:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:40,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744900251] [2025-03-17 11:45:40,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:40,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:45:40,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:45:40,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:40,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:40,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:40,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744900251] [2025-03-17 11:45:40,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744900251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:40,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977837107] [2025-03-17 11:45:40,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:40,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:40,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:40,984 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:40,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:45:41,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:45:41,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:45:41,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:41,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:41,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:45:41,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:41,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:41,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977837107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:41,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:41,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 11:45:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051888482] [2025-03-17 11:45:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:41,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:41,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:41,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:41,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:41,098 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-17 11:45:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:41,145 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-03-17 11:45:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:41,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2025-03-17 11:45:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:41,146 INFO L225 Difference]: With dead ends: 46 [2025-03-17 11:45:41,147 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 11:45:41,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:41,147 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:41,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 11:45:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-03-17 11:45:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 40 states have internal predecessors, (49), 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-17 11:45:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-17 11:45:41,154 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 9 [2025-03-17 11:45:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:41,154 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-17 11:45:41,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-17 11:45:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-03-17 11:45:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:45:41,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:41,154 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:41,161 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-17 11:45:41,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:41,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:41,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash 951974948, now seen corresponding path program 1 times [2025-03-17 11:45:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:41,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877183957] [2025-03-17 11:45:41,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:41,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:41,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:45:41,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:45:41,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:41,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877183957] [2025-03-17 11:45:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877183957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209723383] [2025-03-17 11:45:41,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:41,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:41,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:45:41,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:45:41,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:45:41,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:41,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:41,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 11:45:41,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:41,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:41,760 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-17 11:45:41,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2025-03-17 11:45:41,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 11:45:41,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:41,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 19 [2025-03-17 11:45:41,796 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 10 treesize of output 8 [2025-03-17 11:45:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:42,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:42,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:45:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209723383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:42,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:42,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-17 11:45:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700681906] [2025-03-17 11:45:42,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:42,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:45:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:42,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:45:42,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:45:42,410 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:42,629 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2025-03-17 11:45:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:42,630 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:45:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:42,631 INFO L225 Difference]: With dead ends: 44 [2025-03-17 11:45:42,631 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 11:45:42,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:45:42,632 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:42,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 203 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 11:45:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2025-03-17 11:45:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 38 states have internal predecessors, (47), 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-17 11:45:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-17 11:45:42,635 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2025-03-17 11:45:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:42,635 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-17 11:45:42,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-17 11:45:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:42,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:42,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:42,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:42,840 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:42,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1253901848, now seen corresponding path program 1 times [2025-03-17 11:45:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:42,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454538049] [2025-03-17 11:45:42,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:42,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:42,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:42,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:42,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454538049] [2025-03-17 11:45:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454538049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223872958] [2025-03-17 11:45:42,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:42,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:42,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:42,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:42,894 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:42,912 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-17 11:45:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:45:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:42,913 INFO L225 Difference]: With dead ends: 38 [2025-03-17 11:45:42,913 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 11:45:42,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:42,913 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 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-17 11:45:42,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 11:45:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 11:45:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 37 states have internal predecessors, (46), 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-17 11:45:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-17 11:45:42,915 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 10 [2025-03-17 11:45:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:42,917 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-17 11:45:42,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-17 11:45:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:42,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:42,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:42,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:45:42,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:42,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1253901849, now seen corresponding path program 1 times [2025-03-17 11:45:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028137475] [2025-03-17 11:45:42,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:42,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:42,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:42,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:42,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:43,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028137475] [2025-03-17 11:45:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028137475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:43,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:43,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771208705] [2025-03-17 11:45:43,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:43,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:43,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:43,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:43,062 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:43,123 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-03-17 11:45:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:45:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:43,125 INFO L225 Difference]: With dead ends: 55 [2025-03-17 11:45:43,125 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 11:45:43,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:43,126 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:43,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 11:45:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-03-17 11:45:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.475) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-17 11:45:43,132 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 10 [2025-03-17 11:45:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:43,132 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-17 11:45:43,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-17 11:45:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:43,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:43,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:43,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:45:43,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:43,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1298255112, now seen corresponding path program 1 times [2025-03-17 11:45:43,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:43,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461306040] [2025-03-17 11:45:43,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:43,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:43,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:43,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:43,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461306040] [2025-03-17 11:45:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461306040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:43,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276088557] [2025-03-17 11:45:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:43,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:43,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:43,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:43,337 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:43,376 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-03-17 11:45:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:43,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:45:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:43,377 INFO L225 Difference]: With dead ends: 53 [2025-03-17 11:45:43,378 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 11:45:43,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:43,378 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:43,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 98 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 11:45:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2025-03-17 11:45:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.6) internal successors, (48), 39 states have internal predecessors, (48), 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-17 11:45:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-17 11:45:43,382 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 10 [2025-03-17 11:45:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:43,382 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-17 11:45:43,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-17 11:45:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:45:43,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:43,382 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:43,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:45:43,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:43,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1659377603, now seen corresponding path program 1 times [2025-03-17 11:45:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:43,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77022281] [2025-03-17 11:45:43,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:43,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:45:43,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:45:43,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:43,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77022281] [2025-03-17 11:45:43,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77022281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:43,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896169272] [2025-03-17 11:45:43,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:43,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:43,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:43,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:45:43,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:45:43,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:45:43,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:45:43,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:43,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:43,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896169272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:43,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:43,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 11:45:43,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948365257] [2025-03-17 11:45:43,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:43,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:43,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:43,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:43,554 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-17 11:45:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:43,567 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-03-17 11:45:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:43,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-03-17 11:45:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:43,568 INFO L225 Difference]: With dead ends: 54 [2025-03-17 11:45:43,568 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 11:45:43,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:43,569 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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-17 11:45:43,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 11:45:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 11:45:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 53 states have internal predecessors, (63), 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-17 11:45:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-17 11:45:43,571 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 13 [2025-03-17 11:45:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-17 11:45:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-17 11:45:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-17 11:45:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:45:43,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:43,571 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:43,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:43,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:43,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:43,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -137573756, now seen corresponding path program 1 times [2025-03-17 11:45:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265217927] [2025-03-17 11:45:43,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:43,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:45:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:45:43,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:43,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265217927] [2025-03-17 11:45:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265217927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281925390] [2025-03-17 11:45:43,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:43,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:43,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:43,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:45:44,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:45:44,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:45:44,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:44,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:44,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:45:44,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:44,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:44,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-17 11:45:44,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:44,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:44,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-03-17 11:45:44,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:44,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:44,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:45:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:44,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:44,515 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:45:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:44,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281925390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:44,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:44,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2025-03-17 11:45:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275166232] [2025-03-17 11:45:44,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:45:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:44,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:45:44,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:45:44,574 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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-17 11:45:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:44,756 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-03-17 11:45:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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 13 [2025-03-17 11:45:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:44,756 INFO L225 Difference]: With dead ends: 54 [2025-03-17 11:45:44,756 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 11:45:44,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:45:44,758 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:44,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 155 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 11:45:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-17 11:45:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 51 states have internal predecessors, (61), 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-17 11:45:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-03-17 11:45:44,763 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 13 [2025-03-17 11:45:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:44,763 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-03-17 11:45:44,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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-17 11:45:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-03-17 11:45:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:45:44,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:44,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:44,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:44,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:44,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:44,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash -98907469, now seen corresponding path program 1 times [2025-03-17 11:45:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432926522] [2025-03-17 11:45:44,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:44,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:45:44,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:45:44,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:44,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432926522] [2025-03-17 11:45:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432926522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:45,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:45,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804068737] [2025-03-17 11:45:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:45,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:45,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:45,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:45,015 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-17 11:45:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:45,038 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-03-17 11:45:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-17 11:45:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:45,039 INFO L225 Difference]: With dead ends: 68 [2025-03-17 11:45:45,039 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 11:45:45,039 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-17 11:45:45,039 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:45,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 70 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 11:45:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2025-03-17 11:45:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 52 states have internal predecessors, (62), 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-17 11:45:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-03-17 11:45:45,041 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 14 [2025-03-17 11:45:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:45,041 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-03-17 11:45:45,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-17 11:45:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-03-17 11:45:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:45:45,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:45,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:45,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:45:45,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:45,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1228856641, now seen corresponding path program 1 times [2025-03-17 11:45:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:45,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794503055] [2025-03-17 11:45:45,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:45,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:45,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:45:45,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:45:45,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794503055] [2025-03-17 11:45:45,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794503055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:45,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:45,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953919375] [2025-03-17 11:45:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:45,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:45,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:45,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:45,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:45,075 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-17 11:45:45,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:45,098 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-17 11:45:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:45,098 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), 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 15 [2025-03-17 11:45:45,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:45,099 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:45:45,099 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 11:45:45,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 11:45:45,099 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:45,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 47 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 11:45:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 11:45:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 50 states have internal predecessors, (60), 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-17 11:45:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-03-17 11:45:45,105 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 15 [2025-03-17 11:45:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:45,105 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-03-17 11:45:45,105 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), 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-17 11:45:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-03-17 11:45:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:45:45,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:45,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:45,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:45:45,105 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1228856642, now seen corresponding path program 1 times [2025-03-17 11:45:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:45,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722880508] [2025-03-17 11:45:45,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:45,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:45:45,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:45:45,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:45,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:45,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722880508] [2025-03-17 11:45:45,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722880508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:45,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423642709] [2025-03-17 11:45:45,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:45,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:45,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:45,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:45,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:45:45,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:45:45,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:45:45,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:45,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:45,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:45:45,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:45,373 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 22 treesize of output 18 [2025-03-17 11:45:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423642709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:45,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:45,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-17 11:45:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758651577] [2025-03-17 11:45:45,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:45:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:45,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:45:45,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:45:45,381 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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-17 11:45:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:45,438 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2025-03-17 11:45:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:45:45,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 15 [2025-03-17 11:45:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:45,439 INFO L225 Difference]: With dead ends: 73 [2025-03-17 11:45:45,439 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 11:45:45,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:45:45,439 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 59 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:45,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 76 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 11:45:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2025-03-17 11:45:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.375) internal successors, (66), 54 states have internal predecessors, (66), 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-17 11:45:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-03-17 11:45:45,443 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 15 [2025-03-17 11:45:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:45,444 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-03-17 11:45:45,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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-17 11:45:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-03-17 11:45:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:45:45,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:45,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:45,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:45:45,644 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,SelfDestructingSolverStorable12 [2025-03-17 11:45:45,645 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:45,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash -560149806, now seen corresponding path program 1 times [2025-03-17 11:45:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595198448] [2025-03-17 11:45:45,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:45,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:45:45,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:45:45,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595198448] [2025-03-17 11:45:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595198448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:45,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352168966] [2025-03-17 11:45:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:45,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:45,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:45,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:45,690 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-17 11:45:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:45,709 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-03-17 11:45:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-03-17 11:45:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:45,710 INFO L225 Difference]: With dead ends: 54 [2025-03-17 11:45:45,710 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 11:45:45,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 11:45:45,711 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:45,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 11:45:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 11:45:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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-17 11:45:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-17 11:45:45,713 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 16 [2025-03-17 11:45:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:45,713 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-17 11:45:45,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-17 11:45:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-17 11:45:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:45:45,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:45,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:45:45,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -560149805, now seen corresponding path program 1 times [2025-03-17 11:45:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351661390] [2025-03-17 11:45:45,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:45,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:45:45,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:45:45,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:45,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351661390] [2025-03-17 11:45:45,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351661390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744003418] [2025-03-17 11:45:45,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:45,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:45,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:45,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:45:45,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:45:45,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:45:45,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:45,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:45,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:45:45,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:45,971 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 22 treesize of output 18 [2025-03-17 11:45:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:45,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744003418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:45,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:45,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-17 11:45:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992007673] [2025-03-17 11:45:45,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:45,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:45:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:45,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:45:45,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:45:45,985 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:46,070 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-03-17 11:45:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:45:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 11:45:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:46,071 INFO L225 Difference]: With dead ends: 63 [2025-03-17 11:45:46,071 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 11:45:46,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:45:46,071 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:46,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 79 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 11:45:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2025-03-17 11:45:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 56 states have internal predecessors, (69), 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-17 11:45:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-03-17 11:45:46,075 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 16 [2025-03-17 11:45:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:46,075 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-03-17 11:45:46,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-03-17 11:45:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:45:46,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:46,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:46,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 11:45:46,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -184751978, now seen corresponding path program 1 times [2025-03-17 11:45:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715486739] [2025-03-17 11:45:46,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:45:46,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:45:46,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:46,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:46,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:46,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715486739] [2025-03-17 11:45:46,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715486739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:46,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:46,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:46,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820290660] [2025-03-17 11:45:46,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:46,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:46,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:46,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:46,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:46,333 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:46,346 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2025-03-17 11:45:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:46,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 11:45:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:46,347 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:45:46,347 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:45:46,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 11:45:46,348 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:46,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:45:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 11:45:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 55 states have internal predecessors, (68), 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-17 11:45:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-03-17 11:45:46,351 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 17 [2025-03-17 11:45:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:46,351 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-03-17 11:45:46,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-03-17 11:45:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:45:46,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:46,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:46,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:45:46,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:46,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash -184751977, now seen corresponding path program 1 times [2025-03-17 11:45:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299148716] [2025-03-17 11:45:46,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:46,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:45:46,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:45:46,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:46,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299148716] [2025-03-17 11:45:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299148716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585276112] [2025-03-17 11:45:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:46,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:46,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:46,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:46,414 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:46,433 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-03-17 11:45:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:46,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 11:45:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:46,434 INFO L225 Difference]: With dead ends: 57 [2025-03-17 11:45:46,434 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 11:45:46,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:46,434 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:46,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 11:45:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-03-17 11:45:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 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-17 11:45:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-17 11:45:46,435 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 17 [2025-03-17 11:45:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:46,435 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-17 11:45:46,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-17 11:45:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:45:46,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:46,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:46,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:45:46,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1521522967, now seen corresponding path program 1 times [2025-03-17 11:45:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350295915] [2025-03-17 11:45:46,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:46,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:45:46,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:45:46,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:46,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:46,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350295915] [2025-03-17 11:45:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350295915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836545673] [2025-03-17 11:45:46,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:46,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:46,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:46,508 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:46,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:45:46,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:45:46,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:45:46,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:46,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:45:46,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:46,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836545673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-17 11:45:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768383085] [2025-03-17 11:45:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:46,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:46,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:46,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:45:46,611 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:46,637 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2025-03-17 11:45:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:46,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 11:45:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:46,637 INFO L225 Difference]: With dead ends: 71 [2025-03-17 11:45:46,637 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 11:45:46,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:45:46,638 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:46,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 11:45:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-17 11:45:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 68 states have internal predecessors, (85), 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-17 11:45:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-03-17 11:45:46,639 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 20 [2025-03-17 11:45:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:46,639 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-03-17 11:45:46,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-03-17 11:45:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:45:46,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:46,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:46,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:46,847 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 524450614, now seen corresponding path program 1 times [2025-03-17 11:45:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239318057] [2025-03-17 11:45:46,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:45:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:45:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:46,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:46,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239318057] [2025-03-17 11:45:46,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239318057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:46,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466961897] [2025-03-17 11:45:46,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:46,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:46,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:46,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:46,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:45:46,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:45:46,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:45:46,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:46,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:46,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:45:46,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:47,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466961897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:47,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:47,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 11:45:47,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699936809] [2025-03-17 11:45:47,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:47,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:45:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:45:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:45:47,031 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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-17 11:45:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:47,062 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2025-03-17 11:45:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:45:47,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 11:45:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:47,063 INFO L225 Difference]: With dead ends: 91 [2025-03-17 11:45:47,063 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 11:45:47,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:45:47,063 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:47,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 116 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 11:45:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2025-03-17 11:45:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 71 states have internal predecessors, (89), 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-17 11:45:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2025-03-17 11:45:47,066 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 20 [2025-03-17 11:45:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:47,066 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2025-03-17 11:45:47,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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-17 11:45:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2025-03-17 11:45:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:47,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:47,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:47,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:47,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:47,267 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:47,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -77405485, now seen corresponding path program 1 times [2025-03-17 11:45:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:47,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951247126] [2025-03-17 11:45:47,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:47,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:47,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:47,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:47,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:47,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951247126] [2025-03-17 11:45:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951247126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:47,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:47,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465189972] [2025-03-17 11:45:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:47,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:47,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:47,386 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:47,422 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2025-03-17 11:45:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:47,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:47,423 INFO L225 Difference]: With dead ends: 117 [2025-03-17 11:45:47,423 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 11:45:47,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:47,423 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:47,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 11:45:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2025-03-17 11:45:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 112 states have internal predecessors, (144), 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-17 11:45:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2025-03-17 11:45:47,428 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 21 [2025-03-17 11:45:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:47,429 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2025-03-17 11:45:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2025-03-17 11:45:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:45:47,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:47,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:47,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:45:47,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash -486229710, now seen corresponding path program 1 times [2025-03-17 11:45:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617696596] [2025-03-17 11:45:47,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:47,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:47,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:47,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:47,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:47,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617696596] [2025-03-17 11:45:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617696596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709607167] [2025-03-17 11:45:47,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:47,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:47,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:47,687 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:47,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:45:47,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:45:47,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:45:47,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:47,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 11:45:47,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:47,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:47,787 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 11:45:47,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-03-17 11:45:47,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 11:45:47,802 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 10 treesize of output 8 [2025-03-17 11:45:47,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15 [2025-03-17 11:45:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:48,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709607167] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:48,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:45:48,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2025-03-17 11:45:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349582943] [2025-03-17 11:45:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:48,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:48,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:48,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:45:48,146 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:48,181 INFO L93 Difference]: Finished difference Result 143 states and 184 transitions. [2025-03-17 11:45:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:48,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-17 11:45:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:48,182 INFO L225 Difference]: With dead ends: 143 [2025-03-17 11:45:48,182 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 11:45:48,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:45:48,182 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:48,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 11:45:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2025-03-17 11:45:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.351063829787234) internal successors, (127), 97 states have internal predecessors, (127), 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-17 11:45:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2025-03-17 11:45:48,185 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 21 [2025-03-17 11:45:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:48,185 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2025-03-17 11:45:48,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2025-03-17 11:45:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:45:48,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:48,186 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-17 11:45:48,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:48,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:48,386 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:48,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1895422093, now seen corresponding path program 1 times [2025-03-17 11:45:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:48,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808032241] [2025-03-17 11:45:48,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:48,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:45:48,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:45:48,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:48,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808032241] [2025-03-17 11:45:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808032241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917873478] [2025-03-17 11:45:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:48,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:48,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:48,405 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:48,413 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2025-03-17 11:45:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 11:45:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:48,414 INFO L225 Difference]: With dead ends: 102 [2025-03-17 11:45:48,414 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 11:45:48,414 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-17 11:45:48,415 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 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-17 11:45:48,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 11:45:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 11:45:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.336734693877551) internal successors, (131), 101 states have internal predecessors, (131), 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-17 11:45:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2025-03-17 11:45:48,418 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 22 [2025-03-17 11:45:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:48,418 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2025-03-17 11:45:48,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2025-03-17 11:45:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:45:48,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:48,418 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-17 11:45:48,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:45:48,418 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:48,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1866792942, now seen corresponding path program 1 times [2025-03-17 11:45:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669958409] [2025-03-17 11:45:48,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:48,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:45:48,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:45:48,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:48,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:48,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669958409] [2025-03-17 11:45:48,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669958409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464535283] [2025-03-17 11:45:48,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:48,590 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:48,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 11:45:48,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:45:48,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:45:48,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:48,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:48,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:45:48,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:48,835 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc10#1.base_13| Int) (|v_ULTIMATE.start_main_#t~malloc12#1.base_13| Int) (|v_ULTIMATE.start_main_#t~malloc11#1.base_13| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc10#1.base_13| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11#1.base_13|) 0) (= (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc11#1.base_13| 1) |v_ULTIMATE.start_main_#t~malloc12#1.base_13|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc10#1.base_13|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc10#1.base_13| 0) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| 0) |v_ULTIMATE.start_main_#t~malloc12#1.base_13| 0))))) is different from true [2025-03-17 11:45:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:45:48,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464535283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:48,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 11:45:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245807] [2025-03-17 11:45:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:48,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:48,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:48,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2025-03-17 11:45:48,836 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:48,867 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-03-17 11:45:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 11:45:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:48,868 INFO L225 Difference]: With dead ends: 101 [2025-03-17 11:45:48,868 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 11:45:48,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2025-03-17 11:45:48,868 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:48,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2025-03-17 11:45:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 11:45:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 11:45:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 99 states have internal predecessors, (126), 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-17 11:45:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2025-03-17 11:45:48,873 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 22 [2025-03-17 11:45:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:48,873 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2025-03-17 11:45:48,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2025-03-17 11:45:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:45:48,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:48,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:48,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:49,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 11:45:49,075 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:49,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2036027239, now seen corresponding path program 1 times [2025-03-17 11:45:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:49,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764596124] [2025-03-17 11:45:49,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:49,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:49,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:49,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:49,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:49,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764596124] [2025-03-17 11:45:49,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764596124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138660453] [2025-03-17 11:45:49,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:49,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:49,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:49,131 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:49,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 11:45:49,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:49,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:49,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:49,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:49,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:45:49,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:49,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:45:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138660453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:45:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 11:45:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627816385] [2025-03-17 11:45:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:49,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:49,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:49,250 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:49,272 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2025-03-17 11:45:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:49,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:45:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:49,273 INFO L225 Difference]: With dead ends: 146 [2025-03-17 11:45:49,273 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 11:45:49,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:49,273 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:49,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 11:45:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-17 11:45:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 109 states have internal predecessors, (138), 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-17 11:45:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 138 transitions. [2025-03-17 11:45:49,276 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 138 transitions. Word has length 23 [2025-03-17 11:45:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:49,276 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 138 transitions. [2025-03-17 11:45:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 138 transitions. [2025-03-17 11:45:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:45:49,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:49,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:49,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:49,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 11:45:49,478 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:49,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1787685950, now seen corresponding path program 2 times [2025-03-17 11:45:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546580862] [2025-03-17 11:45:49,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:49,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:49,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 11:45:49,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:49,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:49,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:45:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546580862] [2025-03-17 11:45:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546580862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818330149] [2025-03-17 11:45:49,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:49,674 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:49,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 11:45:49,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 11:45:49,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:49,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:49,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:49,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:45:49,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:49,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:49,953 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 24 treesize of output 20 [2025-03-17 11:45:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818330149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:50,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2025-03-17 11:45:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464228506] [2025-03-17 11:45:50,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:50,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:45:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:50,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:45:50,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:45:50,021 INFO L87 Difference]: Start difference. First operand 110 states and 138 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 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-17 11:45:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:50,298 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2025-03-17 11:45:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:45:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:45:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:50,299 INFO L225 Difference]: With dead ends: 144 [2025-03-17 11:45:50,300 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 11:45:50,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:45:50,301 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:50,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 175 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 11:45:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2025-03-17 11:45:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 83 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2025-03-17 11:45:50,303 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 23 [2025-03-17 11:45:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:50,305 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2025-03-17 11:45:50,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 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-17 11:45:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2025-03-17 11:45:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:45:50,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:50,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:50,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 11:45:50,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 11:45:50,506 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:50,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2029050, now seen corresponding path program 1 times [2025-03-17 11:45:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432343966] [2025-03-17 11:45:50,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:50,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:50,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:50,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:50,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:50,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432343966] [2025-03-17 11:45:50,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432343966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993849735] [2025-03-17 11:45:50,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:50,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:50,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 11:45:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:50,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:50,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:50,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:45:50,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:50,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993849735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:50,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 11:45:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218353410] [2025-03-17 11:45:50,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:50,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:45:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:50,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:45:50,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:45:50,724 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-17 11:45:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:50,764 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2025-03-17 11:45:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:45:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:45:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:50,764 INFO L225 Difference]: With dead ends: 137 [2025-03-17 11:45:50,764 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 11:45:50,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:45:50,765 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:50,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 11:45:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-17 11:45:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2025-03-17 11:45:50,767 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 23 [2025-03-17 11:45:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:50,767 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2025-03-17 11:45:50,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-17 11:45:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2025-03-17 11:45:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:45:50,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:50,767 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] [2025-03-17 11:45:50,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:50,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 11:45:50,969 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:50,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash -937408128, now seen corresponding path program 2 times [2025-03-17 11:45:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:50,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120421911] [2025-03-17 11:45:50,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:50,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:50,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 11:45:50,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:45:50,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:50,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:45:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120421911] [2025-03-17 11:45:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120421911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724755063] [2025-03-17 11:45:51,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:51,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:51,150 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:51,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 11:45:51,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 11:45:51,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:45:51,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:51,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:51,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:45:51,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:51,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:51,435 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 24 treesize of output 20 [2025-03-17 11:45:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:45:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724755063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:51,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-17 11:45:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477177053] [2025-03-17 11:45:51,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:45:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:51,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:45:51,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:45:51,475 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 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-17 11:45:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:51,709 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2025-03-17 11:45:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:45:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 11:45:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:51,710 INFO L225 Difference]: With dead ends: 168 [2025-03-17 11:45:51,710 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 11:45:51,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:45:51,711 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:51,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 225 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 11:45:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 81. [2025-03-17 11:45:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 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-17 11:45:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2025-03-17 11:45:51,714 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 26 [2025-03-17 11:45:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:51,714 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2025-03-17 11:45:51,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 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-17 11:45:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2025-03-17 11:45:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:45:51,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:51,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:51,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:51,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:51,920 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:51,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2090529152, now seen corresponding path program 1 times [2025-03-17 11:45:51,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:51,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204823583] [2025-03-17 11:45:51,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:51,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:51,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:45:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:45:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:51,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:45:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204823583] [2025-03-17 11:45:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204823583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601239095] [2025-03-17 11:45:52,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:52,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:52,146 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:52,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 11:45:52,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:45:52,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:45:52,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:52,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:52,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:45:52,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:52,259 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 10 treesize of output 8 [2025-03-17 11:45:52,273 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 11:45:52,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-03-17 11:45:52,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15 [2025-03-17 11:45:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:45:52,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:45:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601239095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:53,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:53,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-17 11:45:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138579249] [2025-03-17 11:45:53,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:53,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:45:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:53,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:45:53,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:45:53,081 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 17 states, 16 states have (on average 5.8125) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:53,397 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2025-03-17 11:45:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:45:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.8125) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 11:45:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:53,398 INFO L225 Difference]: With dead ends: 145 [2025-03-17 11:45:53,398 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 11:45:53,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:45:53,399 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:53,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 11:45:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2025-03-17 11:45:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 132 states have internal predecessors, (167), 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-17 11:45:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2025-03-17 11:45:53,404 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 35 [2025-03-17 11:45:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2025-03-17 11:45:53,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.8125) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2025-03-17 11:45:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:45:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:53,404 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:53,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 11:45:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 11:45:53,605 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:53,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash 31914752, now seen corresponding path program 2 times [2025-03-17 11:45:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276890482] [2025-03-17 11:45:53,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:53,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-17 11:45:53,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:45:53,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:53,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:53,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276890482] [2025-03-17 11:45:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276890482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975481634] [2025-03-17 11:45:53,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:53,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:53,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:53,742 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:53,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 11:45:53,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-17 11:45:53,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:45:53,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:53,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:53,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 11:45:53,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 11:45:53,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 11:45:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975481634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:53,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:53,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2025-03-17 11:45:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30023896] [2025-03-17 11:45:53,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:53,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:45:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:53,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:45:53,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:45:53,990 INFO L87 Difference]: Start difference. First operand 133 states and 167 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:54,044 INFO L93 Difference]: Finished difference Result 242 states and 295 transitions. [2025-03-17 11:45:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:45:54,044 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-17 11:45:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:54,045 INFO L225 Difference]: With dead ends: 242 [2025-03-17 11:45:54,045 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 11:45:54,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:45:54,045 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:54,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 11:45:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2025-03-17 11:45:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 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-17 11:45:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 173 transitions. [2025-03-17 11:45:54,052 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 173 transitions. Word has length 57 [2025-03-17 11:45:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:54,052 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 173 transitions. [2025-03-17 11:45:54,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2025-03-17 11:45:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 11:45:54,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:54,052 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:54,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 11:45:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 11:45:54,253 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:54,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1424088058, now seen corresponding path program 3 times [2025-03-17 11:45:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:54,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638556019] [2025-03-17 11:45:54,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:54,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 6 equivalence classes. [2025-03-17 11:45:54,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:45:54,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:45:54,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:54,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638556019] [2025-03-17 11:45:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638556019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937968578] [2025-03-17 11:45:54,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:54,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:54,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:54,407 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:54,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 11:45:54,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 6 equivalence classes. [2025-03-17 11:45:54,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:45:54,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:45:54,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:54,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 11:45:54,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:54,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937968578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:54,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-17 11:45:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987638388] [2025-03-17 11:45:54,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:54,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:45:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:54,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:45:54,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:45:54,736 INFO L87 Difference]: Start difference. First operand 139 states and 173 transitions. Second operand has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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-17 11:45:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:54,805 INFO L93 Difference]: Finished difference Result 330 states and 402 transitions. [2025-03-17 11:45:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:45:54,806 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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 60 [2025-03-17 11:45:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:54,806 INFO L225 Difference]: With dead ends: 330 [2025-03-17 11:45:54,806 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 11:45:54,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:45:54,807 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:54,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 297 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 11:45:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2025-03-17 11:45:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 144 states have internal predecessors, (179), 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-17 11:45:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2025-03-17 11:45:54,809 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 60 [2025-03-17 11:45:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:54,809 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2025-03-17 11:45:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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-17 11:45:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2025-03-17 11:45:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 11:45:54,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:54,810 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:54,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:55,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:55,010 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:55,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash -840130368, now seen corresponding path program 4 times [2025-03-17 11:45:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559071858] [2025-03-17 11:45:55,011 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:55,019 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-03-17 11:45:55,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:45:55,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:45:55,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 9 proven. 85 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559071858] [2025-03-17 11:45:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559071858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020718616] [2025-03-17 11:45:55,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:55,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:55,421 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:55,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 11:45:55,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-03-17 11:45:55,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:45:55,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:45:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:55,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 11:45:55,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:55,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:55,575 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:45:55,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-03-17 11:45:55,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:55,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:55,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:55,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-17 11:45:55,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-17 11:45:56,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2025-03-17 11:45:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 15 proven. 79 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:56,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:45:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020718616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:57,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:57,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-03-17 11:45:57,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916510034] [2025-03-17 11:45:57,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:57,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 11:45:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:57,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 11:45:57,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 11:45:57,147 INFO L87 Difference]: Start difference. First operand 145 states and 179 transitions. Second operand has 33 states, 32 states have (on average 5.71875) internal successors, (183), 33 states have internal predecessors, (183), 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-17 11:45:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:57,606 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2025-03-17 11:45:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:45:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.71875) internal successors, (183), 33 states have internal predecessors, (183), 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 63 [2025-03-17 11:45:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:57,607 INFO L225 Difference]: With dead ends: 175 [2025-03-17 11:45:57,607 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 11:45:57,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:45:57,608 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 49 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:57,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 481 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 11:45:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2025-03-17 11:45:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2470588235294118) internal successors, (212), 170 states have internal predecessors, (212), 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-17 11:45:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 212 transitions. [2025-03-17 11:45:57,610 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 212 transitions. Word has length 63 [2025-03-17 11:45:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:57,611 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 212 transitions. [2025-03-17 11:45:57,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.71875) internal successors, (183), 33 states have internal predecessors, (183), 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-17 11:45:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 212 transitions. [2025-03-17 11:45:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 11:45:57,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:57,611 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:57,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:57,812 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:57,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1771505556, now seen corresponding path program 5 times [2025-03-17 11:45:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996802182] [2025-03-17 11:45:57,812 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:57,821 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 7 equivalence classes. [2025-03-17 11:45:57,830 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 11:45:57,830 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 11:45:57,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 122 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:45:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:57,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996802182] [2025-03-17 11:45:57,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996802182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650702417] [2025-03-17 11:45:57,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:57,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:57,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:57,950 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:57,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 11:45:58,028 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 7 equivalence classes. [2025-03-17 11:45:58,116 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 11:45:58,117 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 11:45:58,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:58,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 11:45:58,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 122 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:45:58,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 122 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:45:58,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650702417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:58,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:58,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-17 11:45:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21799009] [2025-03-17 11:45:58,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:58,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:45:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:58,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:45:58,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:45:58,366 INFO L87 Difference]: Start difference. First operand 171 states and 212 transitions. Second operand has 18 states, 18 states have (on average 6.666666666666667) internal successors, (120), 18 states have internal predecessors, (120), 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-17 11:45:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:58,442 INFO L93 Difference]: Finished difference Result 470 states and 575 transitions. [2025-03-17 11:45:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:45:58,442 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.666666666666667) internal successors, (120), 18 states have internal predecessors, (120), 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 74 [2025-03-17 11:45:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:58,443 INFO L225 Difference]: With dead ends: 470 [2025-03-17 11:45:58,443 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 11:45:58,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 133 SyntacticMatches, 10 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:45:58,444 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 283 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-17 11:45:58,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 283 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 11:45:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2025-03-17 11:45:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.2386363636363635) internal successors, (218), 176 states have internal predecessors, (218), 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-17 11:45:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 218 transitions. [2025-03-17 11:45:58,450 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 218 transitions. Word has length 74 [2025-03-17 11:45:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 218 transitions. [2025-03-17 11:45:58,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.666666666666667) internal successors, (120), 18 states have internal predecessors, (120), 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-17 11:45:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 218 transitions. [2025-03-17 11:45:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 11:45:58,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:58,451 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:58,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:58,651 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-03-17 11:45:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash -218043726, now seen corresponding path program 6 times [2025-03-17 11:45:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085879257] [2025-03-17 11:45:58,652 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:58,661 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 7 equivalence classes. [2025-03-17 11:45:58,694 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 70 of 77 statements. [2025-03-17 11:45:58,695 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-17 11:45:58,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-17 11:45:59,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:59,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085879257] [2025-03-17 11:45:59,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085879257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:59,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444707101] [2025-03-17 11:45:59,174 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:59,176 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:59,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 11:45:59,253 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 7 equivalence classes. [2025-03-17 11:45:59,323 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 70 of 77 statements. [2025-03-17 11:45:59,323 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-17 11:45:59,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:59,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 11:45:59,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:59,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:59,346 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-17 11:45:59,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2025-03-17 11:45:59,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 11:45:59,363 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-17 11:45:59,363 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 1 case distinctions, treesize of input 17 treesize of output 1 [2025-03-17 11:46:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 11:46:00,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 11:46:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444707101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:01,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:01,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 38 [2025-03-17 11:46:01,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628645101] [2025-03-17 11:46:01,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:01,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 11:46:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:01,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 11:46:01,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 11:46:01,307 INFO L87 Difference]: Start difference. First operand 177 states and 218 transitions. Second operand has 39 states, 38 states have (on average 4.578947368421052) internal successors, (174), 39 states have internal predecessors, (174), 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-17 11:46:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:03,126 INFO L93 Difference]: Finished difference Result 366 states and 441 transitions. [2025-03-17 11:46:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-17 11:46:03,127 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.578947368421052) internal successors, (174), 39 states have internal predecessors, (174), 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 77 [2025-03-17 11:46:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:03,127 INFO L225 Difference]: With dead ends: 366 [2025-03-17 11:46:03,127 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:46:03,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=912, Invalid=4788, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 11:46:03,128 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 228 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:03,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 546 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:46:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:46:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:46:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-17 11:46:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:46:03,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2025-03-17 11:46:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:03,129 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:46:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.578947368421052) internal successors, (174), 39 states have internal predecessors, (174), 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-17 11:46:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:46:03,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-03-17 11:46:03,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2025-03-17 11:46:03,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-03-17 11:46:03,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-03-17 11:46:03,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 13 remaining) [2025-03-17 11:46:03,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-17 11:46:03,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-17 11:46:03,334 INFO L422 BasicCegarLoop]: Path program histogram: [6, 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] [2025-03-17 11:46:03,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:46:03,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:46:03 BoogieIcfgContainer [2025-03-17 11:46:03,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:46:03,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:46:03,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:46:03,338 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:46:03,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:39" (3/4) ... [2025-03-17 11:46:03,339 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:46:03,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-17 11:46:03,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:46:03,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:46:03,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:46:03,394 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:46:03,395 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:46:03,395 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:46:03,395 INFO L158 Benchmark]: Toolchain (without parser) took 24456.11ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 121.3MB in the beginning and 218.0MB in the end (delta: -96.6MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2025-03-17 11:46:03,395 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:03,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.91ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 104.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:46:03,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.72ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:03,396 INFO L158 Benchmark]: Boogie Preprocessor took 36.83ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 100.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:03,396 INFO L158 Benchmark]: IcfgBuilder took 355.57ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 84.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:46:03,396 INFO L158 Benchmark]: TraceAbstraction took 23651.19ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 83.4MB in the beginning and 222.3MB in the end (delta: -138.9MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2025-03-17 11:46:03,396 INFO L158 Benchmark]: Witness Printer took 57.22ms. Allocated memory is still 385.9MB. Free memory was 222.3MB in the beginning and 218.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:46:03,396 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.91ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 104.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.72ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.83ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 100.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.57ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 84.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23651.19ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 83.4MB in the beginning and 222.3MB in the end (delta: -138.9MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Witness Printer took 57.22ms. Allocated memory is still 385.9MB. Free memory was 222.3MB in the beginning and 218.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 536]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 43 edges, 13 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 33, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 4467 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 3544 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3633 IncrementalHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 923 mSDtfsCounter, 3633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1391 GetRequests, 974 SyntacticMatches, 29 SemanticMatches, 388 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=32, InterpolantAutomatonStates: 263, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 306 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 1408 NumberOfCodeBlocks, 1394 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 1872 ConstructedInterpolants, 134 QuantifiedInterpolants, 26256 SizeOfPredicates, 89 NumberOfNonLiveVariables, 3920 ConjunctsInSsa, 393 ConjunctsInUnsatCore, 68 InterpolantComputations, 19 PerfectInterpolantSequences, 1142/2000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:46:03,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE